./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a38205e3959e6525b83c93048d4c167030358e78fc3e837355c804b08f2636e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:33:24,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:33:24,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:33:24,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:33:24,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:33:24,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:33:24,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:33:24,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:33:24,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:33:24,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:33:24,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:33:24,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:33:24,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:33:24,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:33:24,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:33:24,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:33:24,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:33:24,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:33:24,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:33:24,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:33:24,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:33:24,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:33:24,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:33:24,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:33:24,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:33:24,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:33:24,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:33:24,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:33:24,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:33:24,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:33:24,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:33:24,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:33:24,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:33:24,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:33:24,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:33:24,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:33:24,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:33:24,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:33:24,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:33:24,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:33:24,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:33:24,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:33:24,974 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a38205e3959e6525b83c93048d4c167030358e78fc3e837355c804b08f2636e [2024-10-23 21:33:25,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:33:25,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:33:25,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:33:25,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:33:25,210 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:33:25,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c [2024-10-23 21:33:26,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:33:26,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:33:26,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c [2024-10-23 21:33:26,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3103a545d/4c4ef0f507434f298d6e112660a1d83a/FLAG5c0cc1233 [2024-10-23 21:33:27,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3103a545d/4c4ef0f507434f298d6e112660a1d83a [2024-10-23 21:33:27,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:33:27,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:33:27,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:33:27,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:33:27,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:33:27,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:33:27" (1/1) ... [2024-10-23 21:33:27,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73239218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:27, skipping insertion in model container [2024-10-23 21:33:27,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:33:27" (1/1) ... [2024-10-23 21:33:27,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:33:27,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c[2227,2240] [2024-10-23 21:33:27,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:33:27,969 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:33:27,981 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c[2227,2240] [2024-10-23 21:33:28,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:33:28,251 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:33:28,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28 WrapperNode [2024-10-23 21:33:28,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:33:28,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:33:28,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:33:28,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:33:28,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,516 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-23 21:33:28,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:33:28,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:33:28,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:33:28,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:33:28,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 21:33:28,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:33:28,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:33:28,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:33:28,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:33:28,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (1/1) ... [2024-10-23 21:33:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:33:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:33:28,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:33:28,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:33:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:33:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:33:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:33:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:33:29,026 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:33:29,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:33:31,645 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-23 21:33:31,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:33:31,693 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:33:31,694 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:33:31,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:33:31 BoogieIcfgContainer [2024-10-23 21:33:31,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:33:31,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:33:31,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:33:31,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:33:31,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:33:27" (1/3) ... [2024-10-23 21:33:31,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfae707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:33:31, skipping insertion in model container [2024-10-23 21:33:31,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:33:28" (2/3) ... [2024-10-23 21:33:31,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfae707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:33:31, skipping insertion in model container [2024-10-23 21:33:31,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:33:31" (3/3) ... [2024-10-23 21:33:31,701 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label53.c [2024-10-23 21:33:31,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:33:31,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:33:31,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:33:31,777 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29144b9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:33:31,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:33:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 21:33:31,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:31,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:31,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1154787478, now seen corresponding path program 1 times [2024-10-23 21:33:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180603811] [2024-10-23 21:33:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180603811] [2024-10-23 21:33:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180603811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:33:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11939194] [2024-10-23 21:33:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:31,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:33:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:33:31,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:33:31,943 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:31,997 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-23 21:33:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:33:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-23 21:33:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:32,009 INFO L225 Difference]: With dead ends: 1055 [2024-10-23 21:33:32,009 INFO L226 Difference]: Without dead ends: 526 [2024-10-23 21:33:32,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:33:32,015 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:32,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:33:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-23 21:33:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-23 21:33:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-23 21:33:32,056 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 13 [2024-10-23 21:33:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:32,056 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-23 21:33:32,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-23 21:33:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 21:33:32,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:32,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:32,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:33:32,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:32,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 339474226, now seen corresponding path program 1 times [2024-10-23 21:33:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:32,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903931837] [2024-10-23 21:33:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:32,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:32,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903931837] [2024-10-23 21:33:32,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903931837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:32,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:32,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:33:32,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383615803] [2024-10-23 21:33:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:32,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:32,128 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:34,120 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-23 21:33:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-23 21:33:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:34,126 INFO L225 Difference]: With dead ends: 1501 [2024-10-23 21:33:34,127 INFO L226 Difference]: Without dead ends: 976 [2024-10-23 21:33:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:34,129 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 458 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:34,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-23 21:33:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-23 21:33:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-23 21:33:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-23 21:33:34,172 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 13 [2024-10-23 21:33:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:34,173 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-23 21:33:34,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-23 21:33:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-23 21:33:34,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:34,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:33:34,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:34,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 222604954, now seen corresponding path program 1 times [2024-10-23 21:33:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393330763] [2024-10-23 21:33:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393330763] [2024-10-23 21:33:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393330763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:34,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:33:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556485846] [2024-10-23 21:33:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:34,391 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:36,261 INFO L93 Difference]: Finished difference Result 2814 states and 4381 transitions. [2024-10-23 21:33:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-23 21:33:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:36,267 INFO L225 Difference]: With dead ends: 2814 [2024-10-23 21:33:36,267 INFO L226 Difference]: Without dead ends: 1845 [2024-10-23 21:33:36,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:36,269 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:36,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 578 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-23 21:33:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-10-23 21:33:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1840. [2024-10-23 21:33:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3507340946166395) internal successors, (2484), 1839 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2484 transitions. [2024-10-23 21:33:36,296 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2484 transitions. Word has length 80 [2024-10-23 21:33:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:36,296 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2484 transitions. [2024-10-23 21:33:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2484 transitions. [2024-10-23 21:33:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-23 21:33:36,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:36,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:36,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:33:36,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:36,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:36,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1781845506, now seen corresponding path program 1 times [2024-10-23 21:33:36,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:36,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233731091] [2024-10-23 21:33:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:36,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:36,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233731091] [2024-10-23 21:33:36,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233731091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:36,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:33:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116392127] [2024-10-23 21:33:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:36,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:36,424 INFO L87 Difference]: Start difference. First operand 1840 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:38,154 INFO L93 Difference]: Finished difference Result 4551 states and 6284 transitions. [2024-10-23 21:33:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-23 21:33:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:38,162 INFO L225 Difference]: With dead ends: 4551 [2024-10-23 21:33:38,163 INFO L226 Difference]: Without dead ends: 2712 [2024-10-23 21:33:38,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:38,168 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 493 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:38,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 883 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:33:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-23 21:33:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2024-10-23 21:33:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3008490217792543) internal successors, (3524), 2709 states have internal predecessors, (3524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3524 transitions. [2024-10-23 21:33:38,208 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3524 transitions. Word has length 83 [2024-10-23 21:33:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:38,209 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3524 transitions. [2024-10-23 21:33:38,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3524 transitions. [2024-10-23 21:33:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-23 21:33:38,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:38,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:38,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:33:38,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:38,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash -952286071, now seen corresponding path program 1 times [2024-10-23 21:33:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:38,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489865115] [2024-10-23 21:33:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-23 21:33:38,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:38,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489865115] [2024-10-23 21:33:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489865115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:33:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684320682] [2024-10-23 21:33:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:38,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:38,468 INFO L87 Difference]: Start difference. First operand 2710 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:40,160 INFO L93 Difference]: Finished difference Result 7983 states and 10363 transitions. [2024-10-23 21:33:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-10-23 21:33:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:40,171 INFO L225 Difference]: With dead ends: 7983 [2024-10-23 21:33:40,171 INFO L226 Difference]: Without dead ends: 4420 [2024-10-23 21:33:40,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:40,174 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:40,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:33:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-23 21:33:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3565. [2024-10-23 21:33:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3564 states have (on average 1.1778900112233446) internal successors, (4198), 3564 states have internal predecessors, (4198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4198 transitions. [2024-10-23 21:33:40,217 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4198 transitions. Word has length 152 [2024-10-23 21:33:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:40,217 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 4198 transitions. [2024-10-23 21:33:40,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4198 transitions. [2024-10-23 21:33:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-23 21:33:40,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:40,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:40,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:33:40,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 621062677, now seen corresponding path program 1 times [2024-10-23 21:33:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060799301] [2024-10-23 21:33:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060799301] [2024-10-23 21:33:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060799301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:33:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914290468] [2024-10-23 21:33:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:40,353 INFO L87 Difference]: Start difference. First operand 3565 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:41,810 INFO L93 Difference]: Finished difference Result 9262 states and 11077 transitions. [2024-10-23 21:33:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-10-23 21:33:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:41,824 INFO L225 Difference]: With dead ends: 9262 [2024-10-23 21:33:41,824 INFO L226 Difference]: Without dead ends: 5698 [2024-10-23 21:33:41,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:41,828 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:41,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:33:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2024-10-23 21:33:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2024-10-23 21:33:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5697 states have (on average 1.1597331929085484) internal successors, (6607), 5697 states have internal predecessors, (6607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 6607 transitions. [2024-10-23 21:33:41,891 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 6607 transitions. Word has length 165 [2024-10-23 21:33:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 6607 transitions. [2024-10-23 21:33:41,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 6607 transitions. [2024-10-23 21:33:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-23 21:33:41,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:41,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:41,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:33:41,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash 61230928, now seen corresponding path program 1 times [2024-10-23 21:33:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551735743] [2024-10-23 21:33:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551735743] [2024-10-23 21:33:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551735743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:33:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360880774] [2024-10-23 21:33:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:42,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:33:42,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:33:42,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:33:42,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:33:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:42,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:33:42,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:33:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:42,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:33:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:42,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360880774] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:33:42,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:33:42,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-23 21:33:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113733266] [2024-10-23 21:33:42,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:33:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:33:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:33:42,867 INFO L87 Difference]: Start difference. First operand 5698 states and 6607 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:45,657 INFO L93 Difference]: Finished difference Result 16960 states and 19952 transitions. [2024-10-23 21:33:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:33:45,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-23 21:33:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:45,683 INFO L225 Difference]: With dead ends: 16960 [2024-10-23 21:33:45,683 INFO L226 Difference]: Without dead ends: 10383 [2024-10-23 21:33:45,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:33:45,693 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1048 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:45,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 149 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 21:33:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2024-10-23 21:33:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 10378. [2024-10-23 21:33:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10378 states, 10377 states have (on average 1.1553435482316663) internal successors, (11989), 10377 states have internal predecessors, (11989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10378 states to 10378 states and 11989 transitions. [2024-10-23 21:33:45,913 INFO L78 Accepts]: Start accepts. Automaton has 10378 states and 11989 transitions. Word has length 167 [2024-10-23 21:33:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:45,914 INFO L471 AbstractCegarLoop]: Abstraction has 10378 states and 11989 transitions. [2024-10-23 21:33:45,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 11989 transitions. [2024-10-23 21:33:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-23 21:33:45,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:45,920 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:45,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:33:46,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:33:46,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:46,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1385349746, now seen corresponding path program 1 times [2024-10-23 21:33:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17580017] [2024-10-23 21:33:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:46,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 35 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17580017] [2024-10-23 21:33:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17580017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:33:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168166572] [2024-10-23 21:33:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:33:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:33:46,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:33:46,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:33:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:46,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:33:46,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:33:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 164 proven. 73 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 21:33:46,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:33:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 21:33:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168166572] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:33:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:33:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-10-23 21:33:46,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116322209] [2024-10-23 21:33:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:46,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:33:46,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:46,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:33:46,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:33:46,921 INFO L87 Difference]: Start difference. First operand 10378 states and 11989 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:49,230 INFO L93 Difference]: Finished difference Result 28864 states and 33387 transitions. [2024-10-23 21:33:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:33:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-10-23 21:33:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:49,281 INFO L225 Difference]: With dead ends: 28864 [2024-10-23 21:33:49,281 INFO L226 Difference]: Without dead ends: 18487 [2024-10-23 21:33:49,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:33:49,296 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 839 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:49,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 183 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:33:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18487 states. [2024-10-23 21:33:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18487 to 18481. [2024-10-23 21:33:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18481 states, 18480 states have (on average 1.1429112554112555) internal successors, (21121), 18480 states have internal predecessors, (21121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18481 states to 18481 states and 21121 transitions. [2024-10-23 21:33:49,497 INFO L78 Accepts]: Start accepts. Automaton has 18481 states and 21121 transitions. Word has length 241 [2024-10-23 21:33:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:49,497 INFO L471 AbstractCegarLoop]: Abstraction has 18481 states and 21121 transitions. [2024-10-23 21:33:49,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18481 states and 21121 transitions. [2024-10-23 21:33:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-23 21:33:49,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:49,504 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:49,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-23 21:33:49,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-23 21:33:49,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1641664788, now seen corresponding path program 1 times [2024-10-23 21:33:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117185838] [2024-10-23 21:33:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:49,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-23 21:33:50,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:50,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117185838] [2024-10-23 21:33:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117185838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:50,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:33:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438269905] [2024-10-23 21:33:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:50,090 INFO L87 Difference]: Start difference. First operand 18481 states and 21121 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:51,981 INFO L93 Difference]: Finished difference Result 50633 states and 57337 transitions. [2024-10-23 21:33:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:51,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2024-10-23 21:33:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:52,026 INFO L225 Difference]: With dead ends: 50633 [2024-10-23 21:33:52,027 INFO L226 Difference]: Without dead ends: 32153 [2024-10-23 21:33:52,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:52,040 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 426 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:52,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 665 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:33:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32153 states. [2024-10-23 21:33:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32153 to 29569. [2024-10-23 21:33:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29569 states, 29568 states have (on average 1.1311214826839826) internal successors, (33445), 29568 states have internal predecessors, (33445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29569 states to 29569 states and 33445 transitions. [2024-10-23 21:33:52,462 INFO L78 Accepts]: Start accepts. Automaton has 29569 states and 33445 transitions. Word has length 346 [2024-10-23 21:33:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:52,463 INFO L471 AbstractCegarLoop]: Abstraction has 29569 states and 33445 transitions. [2024-10-23 21:33:52,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 29569 states and 33445 transitions. [2024-10-23 21:33:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-23 21:33:52,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:52,468 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:33:52,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1942632305, now seen corresponding path program 1 times [2024-10-23 21:33:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604724299] [2024-10-23 21:33:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-23 21:33:52,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604724299] [2024-10-23 21:33:52,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604724299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:52,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:52,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:33:52,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653267095] [2024-10-23 21:33:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:52,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:33:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:33:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:52,716 INFO L87 Difference]: Start difference. First operand 29569 states and 33445 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:54,417 INFO L93 Difference]: Finished difference Result 68518 states and 77906 transitions. [2024-10-23 21:33:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:33:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2024-10-23 21:33:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:54,465 INFO L225 Difference]: With dead ends: 68518 [2024-10-23 21:33:54,465 INFO L226 Difference]: Without dead ends: 38949 [2024-10-23 21:33:54,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:33:54,494 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 436 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:54,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 638 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:33:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38949 states. [2024-10-23 21:33:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38949 to 36817. [2024-10-23 21:33:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36817 states, 36816 states have (on average 1.1341264667535853) internal successors, (41754), 36816 states have internal predecessors, (41754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36817 states to 36817 states and 41754 transitions. [2024-10-23 21:33:55,147 INFO L78 Accepts]: Start accepts. Automaton has 36817 states and 41754 transitions. Word has length 347 [2024-10-23 21:33:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 36817 states and 41754 transitions. [2024-10-23 21:33:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 36817 states and 41754 transitions. [2024-10-23 21:33:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-23 21:33:55,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:55,154 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:55,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:33:55,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:55,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1603318760, now seen corresponding path program 1 times [2024-10-23 21:33:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:55,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476927913] [2024-10-23 21:33:55,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:55,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 21:33:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476927913] [2024-10-23 21:33:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476927913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:33:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923968505] [2024-10-23 21:33:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:33:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:33:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:33:55,653 INFO L87 Difference]: Start difference. First operand 36817 states and 41754 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:33:58,339 INFO L93 Difference]: Finished difference Result 99667 states and 112881 transitions. [2024-10-23 21:33:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:33:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-23 21:33:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:33:58,430 INFO L225 Difference]: With dead ends: 99667 [2024-10-23 21:33:58,430 INFO L226 Difference]: Without dead ends: 62851 [2024-10-23 21:33:58,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:33:58,464 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 826 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:33:58,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 189 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-23 21:33:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62851 states. [2024-10-23 21:33:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62851 to 57735. [2024-10-23 21:33:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57735 states, 57734 states have (on average 1.1359684068313298) internal successors, (65584), 57734 states have internal predecessors, (65584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57735 states to 57735 states and 65584 transitions. [2024-10-23 21:33:59,578 INFO L78 Accepts]: Start accepts. Automaton has 57735 states and 65584 transitions. Word has length 351 [2024-10-23 21:33:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:33:59,578 INFO L471 AbstractCegarLoop]: Abstraction has 57735 states and 65584 transitions. [2024-10-23 21:33:59,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:33:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 57735 states and 65584 transitions. [2024-10-23 21:33:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-23 21:33:59,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:33:59,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:33:59,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:33:59,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:33:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:33:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1952295752, now seen corresponding path program 1 times [2024-10-23 21:33:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:33:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51223879] [2024-10-23 21:33:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:33:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:33:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:33:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:33:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:33:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51223879] [2024-10-23 21:33:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51223879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:33:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:33:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:33:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186639291] [2024-10-23 21:33:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:33:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:33:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:33:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:33:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:33:59,985 INFO L87 Difference]: Start difference. First operand 57735 states and 65584 transitions. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:02,616 INFO L93 Difference]: Finished difference Result 138520 states and 157085 transitions. [2024-10-23 21:34:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:34:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2024-10-23 21:34:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:02,714 INFO L225 Difference]: With dead ends: 138520 [2024-10-23 21:34:02,714 INFO L226 Difference]: Without dead ends: 78657 [2024-10-23 21:34:02,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:34:02,754 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 557 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:02,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 396 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-23 21:34:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78657 states. [2024-10-23 21:34:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78657 to 77347. [2024-10-23 21:34:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77347 states, 77346 states have (on average 1.1266904558736068) internal successors, (87145), 77346 states have internal predecessors, (87145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77347 states to 77347 states and 87145 transitions. [2024-10-23 21:34:03,773 INFO L78 Accepts]: Start accepts. Automaton has 77347 states and 87145 transitions. Word has length 352 [2024-10-23 21:34:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 77347 states and 87145 transitions. [2024-10-23 21:34:03,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77347 states and 87145 transitions. [2024-10-23 21:34:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-23 21:34:03,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:03,777 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:03,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:34:03,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:03,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1963005406, now seen corresponding path program 1 times [2024-10-23 21:34:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416715340] [2024-10-23 21:34:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:03,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 311 proven. 82 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:34:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:34:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416715340] [2024-10-23 21:34:05,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416715340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:34:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321551361] [2024-10-23 21:34:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:05,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:34:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:34:05,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:34:05,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:34:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:05,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-23 21:34:05,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:34:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 311 proven. 82 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:34:06,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:34:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 392 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:34:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321551361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:34:06,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:34:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-23 21:34:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159554906] [2024-10-23 21:34:06,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:34:06,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 21:34:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:34:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 21:34:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:34:06,934 INFO L87 Difference]: Start difference. First operand 77347 states and 87145 transitions. Second operand has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:11,941 INFO L93 Difference]: Finished difference Result 171937 states and 193624 transitions. [2024-10-23 21:34:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-23 21:34:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2024-10-23 21:34:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:12,046 INFO L225 Difference]: With dead ends: 171937 [2024-10-23 21:34:12,046 INFO L226 Difference]: Without dead ends: 94591 [2024-10-23 21:34:12,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-23 21:34:12,087 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2910 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 6909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:12,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 383 Invalid, 6909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [884 Valid, 6025 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-23 21:34:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94591 states. [2024-10-23 21:34:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94591 to 82426. [2024-10-23 21:34:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82426 states, 82425 states have (on average 1.1208007279344858) internal successors, (92382), 82425 states have internal predecessors, (92382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82426 states to 82426 states and 92382 transitions. [2024-10-23 21:34:13,177 INFO L78 Accepts]: Start accepts. Automaton has 82426 states and 92382 transitions. Word has length 366 [2024-10-23 21:34:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:13,178 INFO L471 AbstractCegarLoop]: Abstraction has 82426 states and 92382 transitions. [2024-10-23 21:34:13,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 82426 states and 92382 transitions. [2024-10-23 21:34:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-23 21:34:13,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:13,182 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:13,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 21:34:13,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:34:13,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -293468210, now seen corresponding path program 1 times [2024-10-23 21:34:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529559565] [2024-10-23 21:34:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-23 21:34:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:34:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529559565] [2024-10-23 21:34:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529559565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:34:14,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:34:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:34:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195714528] [2024-10-23 21:34:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:34:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:34:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:34:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:34:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:14,046 INFO L87 Difference]: Start difference. First operand 82426 states and 92382 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:16,055 INFO L93 Difference]: Finished difference Result 189116 states and 212184 transitions. [2024-10-23 21:34:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:34:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2024-10-23 21:34:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:16,186 INFO L225 Difference]: With dead ends: 189116 [2024-10-23 21:34:16,186 INFO L226 Difference]: Without dead ends: 106689 [2024-10-23 21:34:16,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:16,230 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 437 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:16,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 350 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:34:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106689 states. [2024-10-23 21:34:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106689 to 101985. [2024-10-23 21:34:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101985 states, 101984 states have (on average 1.1074972544712895) internal successors, (112947), 101984 states have internal predecessors, (112947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101985 states to 101985 states and 112947 transitions. [2024-10-23 21:34:17,734 INFO L78 Accepts]: Start accepts. Automaton has 101985 states and 112947 transitions. Word has length 426 [2024-10-23 21:34:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:17,739 INFO L471 AbstractCegarLoop]: Abstraction has 101985 states and 112947 transitions. [2024-10-23 21:34:17,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 101985 states and 112947 transitions. [2024-10-23 21:34:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-23 21:34:17,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:17,747 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:17,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:34:17,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:17,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1761150843, now seen corresponding path program 1 times [2024-10-23 21:34:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887630638] [2024-10-23 21:34:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:17,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-23 21:34:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:34:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887630638] [2024-10-23 21:34:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887630638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:34:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:34:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:34:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375620591] [2024-10-23 21:34:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:34:18,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:34:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:34:18,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:34:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:18,548 INFO L87 Difference]: Start difference. First operand 101985 states and 112947 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:20,567 INFO L93 Difference]: Finished difference Result 216326 states and 239211 transitions. [2024-10-23 21:34:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:34:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2024-10-23 21:34:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:20,696 INFO L225 Difference]: With dead ends: 216326 [2024-10-23 21:34:20,696 INFO L226 Difference]: Without dead ends: 114342 [2024-10-23 21:34:20,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:20,746 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 335 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:20,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 765 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:34:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114342 states. [2024-10-23 21:34:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114342 to 110496. [2024-10-23 21:34:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110496 states, 110495 states have (on average 1.101153898366442) internal successors, (121672), 110495 states have internal predecessors, (121672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110496 states to 110496 states and 121672 transitions. [2024-10-23 21:34:22,308 INFO L78 Accepts]: Start accepts. Automaton has 110496 states and 121672 transitions. Word has length 448 [2024-10-23 21:34:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:22,309 INFO L471 AbstractCegarLoop]: Abstraction has 110496 states and 121672 transitions. [2024-10-23 21:34:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 110496 states and 121672 transitions. [2024-10-23 21:34:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-23 21:34:22,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:22,318 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:34:22,318 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:22,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -836688104, now seen corresponding path program 1 times [2024-10-23 21:34:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541719804] [2024-10-23 21:34:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-23 21:34:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:34:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541719804] [2024-10-23 21:34:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541719804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:34:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:34:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:34:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256286865] [2024-10-23 21:34:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:34:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:34:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:34:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:34:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:22,846 INFO L87 Difference]: Start difference. First operand 110496 states and 121672 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:25,015 INFO L93 Difference]: Finished difference Result 231198 states and 254761 transitions. [2024-10-23 21:34:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:34:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2024-10-23 21:34:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:25,146 INFO L225 Difference]: With dead ends: 231198 [2024-10-23 21:34:25,146 INFO L226 Difference]: Without dead ends: 120703 [2024-10-23 21:34:25,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:25,167 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 496 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:25,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 701 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:34:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120703 states. [2024-10-23 21:34:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120703 to 120274. [2024-10-23 21:34:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120274 states, 120273 states have (on average 1.095881868748597) internal successors, (131805), 120273 states have internal predecessors, (131805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120274 states to 120274 states and 131805 transitions. [2024-10-23 21:34:26,817 INFO L78 Accepts]: Start accepts. Automaton has 120274 states and 131805 transitions. Word has length 492 [2024-10-23 21:34:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:26,817 INFO L471 AbstractCegarLoop]: Abstraction has 120274 states and 131805 transitions. [2024-10-23 21:34:26,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 120274 states and 131805 transitions. [2024-10-23 21:34:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-23 21:34:26,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:26,835 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:34:26,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:26,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash -235892886, now seen corresponding path program 1 times [2024-10-23 21:34:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759920163] [2024-10-23 21:34:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:34:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-23 21:34:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:34:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759920163] [2024-10-23 21:34:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759920163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:34:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:34:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:34:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896971472] [2024-10-23 21:34:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:34:27,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:34:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:34:27,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:34:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:27,321 INFO L87 Difference]: Start difference. First operand 120274 states and 131805 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:34:29,338 INFO L93 Difference]: Finished difference Result 252466 states and 276672 transitions. [2024-10-23 21:34:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:34:29,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2024-10-23 21:34:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:34:29,487 INFO L225 Difference]: With dead ends: 252466 [2024-10-23 21:34:29,487 INFO L226 Difference]: Without dead ends: 131763 [2024-10-23 21:34:29,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:34:29,549 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 325 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:34:29,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 290 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:34:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131763 states. [2024-10-23 21:34:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131763 to 126219. [2024-10-23 21:34:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126219 states, 126218 states have (on average 1.0837439984788224) internal successors, (136788), 126218 states have internal predecessors, (136788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126219 states to 126219 states and 136788 transitions. [2024-10-23 21:34:31,233 INFO L78 Accepts]: Start accepts. Automaton has 126219 states and 136788 transitions. Word has length 498 [2024-10-23 21:34:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:34:31,233 INFO L471 AbstractCegarLoop]: Abstraction has 126219 states and 136788 transitions. [2024-10-23 21:34:31,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:34:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 126219 states and 136788 transitions. [2024-10-23 21:34:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-23 21:34:31,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:34:31,239 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:31,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-23 21:34:31,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:34:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:34:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash 213473206, now seen corresponding path program 1 times [2024-10-23 21:34:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:34:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386379719] [2024-10-23 21:34:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:34:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:34:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:34:34,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 21:34:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:34:34,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 21:34:34,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 21:34:34,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:34:34,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:34:34,511 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:34:34,657 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:34:34,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:34:34 BoogieIcfgContainer [2024-10-23 21:34:34,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:34:34,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:34:34,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:34:34,660 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:34:34,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:33:31" (3/4) ... [2024-10-23 21:34:34,661 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 21:34:34,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:34:34,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:34:34,810 INFO L158 Benchmark]: Toolchain (without parser) took 67637.05ms. Allocated memory was 172.0MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 107.2MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-10-23 21:34:34,810 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:34:34,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1078.29ms. Allocated memory is still 172.0MB. Free memory was 107.2MB in the beginning and 95.7MB in the end (delta: 11.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-10-23 21:34:34,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 263.02ms. Allocated memory was 172.0MB in the beginning and 243.3MB in the end (delta: 71.3MB). Free memory was 95.7MB in the beginning and 147.9MB in the end (delta: -52.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-10-23 21:34:34,811 INFO L158 Benchmark]: Boogie Preprocessor took 330.18ms. Allocated memory is still 243.3MB. Free memory was 147.9MB in the beginning and 103.8MB in the end (delta: 44.1MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-23 21:34:34,811 INFO L158 Benchmark]: RCFGBuilder took 2846.30ms. Allocated memory was 243.3MB in the beginning and 434.1MB in the end (delta: 190.8MB). Free memory was 103.8MB in the beginning and 221.9MB in the end (delta: -118.1MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2024-10-23 21:34:34,811 INFO L158 Benchmark]: TraceAbstraction took 62963.46ms. Allocated memory was 434.1MB in the beginning and 12.1GB in the end (delta: 11.6GB). Free memory was 220.8MB in the beginning and 9.6GB in the end (delta: -9.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-10-23 21:34:34,811 INFO L158 Benchmark]: Witness Printer took 150.12ms. Allocated memory is still 12.1GB. Free memory was 9.6GB in the beginning and 9.5GB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-23 21:34:34,815 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 51.1MB in the beginning and 51.0MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1078.29ms. Allocated memory is still 172.0MB. Free memory was 107.2MB in the beginning and 95.7MB in the end (delta: 11.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 263.02ms. Allocated memory was 172.0MB in the beginning and 243.3MB in the end (delta: 71.3MB). Free memory was 95.7MB in the beginning and 147.9MB in the end (delta: -52.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 330.18ms. Allocated memory is still 243.3MB. Free memory was 147.9MB in the beginning and 103.8MB in the end (delta: 44.1MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2846.30ms. Allocated memory was 243.3MB in the beginning and 434.1MB in the end (delta: 190.8MB). Free memory was 103.8MB in the beginning and 221.9MB in the end (delta: -118.1MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. * TraceAbstraction took 62963.46ms. Allocated memory was 434.1MB in the beginning and 12.1GB in the end (delta: 11.6GB). Free memory was 220.8MB in the beginning and 9.6GB in the end (delta: -9.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 150.12ms. Allocated memory is still 12.1GB. Free memory was 9.6GB in the beginning and 9.5GB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 60]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputA = 1; [L19] int inputB = 2; [L20] int inputC = 3; [L21] int inputE = 5; [L22] int inputD = 4; [L23] int inputF = 6; [L26] int a24 = 1; [L27] int a21 = 124; [L28] int a26 = 222; [L29] int a14 = -79; [L30] int a28 = 111; [L2587] int output = -1; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L334] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L335] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L336] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L337] a24 = 2 [L339] return 25; VAL [\result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND TRUE ( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 )) [L983] a28 = ((((a28 % 299849)- -300149) - 506398) - -506401) [L984] return 26; VAL [\result=26, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND TRUE ((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 ) [L605] a14 = (((((a14 - -113223) + -74409) * 1) % 299909)+ -300090) [L606] a26 = ((((a26 % 95)+ 39) + 32) - 25) [L607] a28 = (((((a28 * 9)/ 10) * 1) % 300018)+ -299980) [L608] return 21; VAL [\result=21, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND TRUE ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 ))) [L273] a26 = (((a26 - -478961) + -415672) + 258271) [L274] a28 = ((((a28 % 299849)- -300149) + 2) * 1) [L275] return 26; VAL [\result=26, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND TRUE ( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2))) [L254] a14 = (((((((a14 * 9)/ 10) % 33)- 138) * 5) % 33)+ -139) [L255] a28 = ((((((a28 * 9)/ 10) * 1) - -10862) % 82)- -216) [L256] a24 = 1 [L258] return -1; VAL [\result=-1, a14=-161, a21=124, a24=1, a26=321561, a28=295, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND TRUE (((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 ) VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] reach_error() VAL [a14=-161, a21=124, a24=1, a26=321561, a28=295, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10875 SdHoareTripleChecker+Valid, 31.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10875 mSDsluCounter, 8923 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1320 mSDsCounter, 6110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29024 IncrementalHoareTripleChecker+Invalid, 35134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6110 mSolverCounterUnsat, 7603 mSDtfsCounter, 29024 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1599 GetRequests, 1561 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126219occurred in iteration=17, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 38709 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 5859 NumberOfCodeBlocks, 5859 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6065 ConstructedInterpolants, 0 QuantifiedInterpolants, 20700 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1143 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 6558/7150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-23 21:34:34,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE