./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:53:12,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:53:12,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:53:12,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:53:12,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:53:12,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:53:12,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:53:12,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:53:12,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:53:12,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:53:12,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:53:12,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:53:12,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:53:12,940 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:53:12,940 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:53:12,940 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:53:12,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:53:12,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:53:12,942 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:53:12,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:53:12,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:53:12,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:53:12,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:53:12,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:53:12,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:53:12,944 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:53:12,944 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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(F end) ) 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 -> 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 [2025-02-06 19:53:13,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:53:13,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:53:13,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:53:13,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:53:13,196 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:53:13,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-02-06 19:53:14,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8b1c388/3d0a490aa88948739d2f02f2aa61476a/FLAGdedf63ba9 [2025-02-06 19:53:14,638 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:53:14,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-02-06 19:53:14,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8b1c388/3d0a490aa88948739d2f02f2aa61476a/FLAGdedf63ba9 [2025-02-06 19:53:14,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c8b1c388/3d0a490aa88948739d2f02f2aa61476a [2025-02-06 19:53:14,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:53:14,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:53:14,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:53:14,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:53:14,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:53:14,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:53:14" (1/1) ... [2025-02-06 19:53:14,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26553b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:14, skipping insertion in model container [2025-02-06 19:53:14,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:53:14" (1/1) ... [2025-02-06 19:53:14,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:53:15,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:53:15,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:53:15,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:53:15,272 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:53:15,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15 WrapperNode [2025-02-06 19:53:15,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:53:15,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:53:15,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:53:15,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:53:15,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,314 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 44, calls inlined = 84, statements flattened = 927 [2025-02-06 19:53:15,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:53:15,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:53:15,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:53:15,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:53:15,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,353 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]. [2025-02-06 19:53:15,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:53:15,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:53:15,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:53:15,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:53:15,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (1/1) ... [2025-02-06 19:53:15,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:53:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:53:15,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:53:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:53:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:53:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:53:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:53:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:53:15,531 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:53:15,532 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:53:16,362 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2025-02-06 19:53:16,362 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:53:16,376 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:53:16,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:53:16,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:53:16 BoogieIcfgContainer [2025-02-06 19:53:16,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:53:16,378 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:53:16,378 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:53:16,382 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:53:16,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:53:16,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:53:14" (1/3) ... [2025-02-06 19:53:16,383 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b4f9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:53:16, skipping insertion in model container [2025-02-06 19:53:16,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:53:16,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:53:15" (2/3) ... [2025-02-06 19:53:16,383 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b4f9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:53:16, skipping insertion in model container [2025-02-06 19:53:16,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:53:16,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:53:16" (3/3) ... [2025-02-06 19:53:16,384 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-02-06 19:53:16,426 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:53:16,426 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:53:16,426 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:53:16,426 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:53:16,426 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:53:16,426 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:53:16,427 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:53:16,427 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:53:16,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 274 states, 273 states have (on average 1.564102564102564) internal successors, (427), 273 states have internal predecessors, (427), 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) [2025-02-06 19:53:16,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 254 [2025-02-06 19:53:16,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:16,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:16,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:53:16,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:16,462 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:53:16,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 274 states, 273 states have (on average 1.564102564102564) internal successors, (427), 273 states have internal predecessors, (427), 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) [2025-02-06 19:53:16,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 254 [2025-02-06 19:53:16,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:16,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:16,472 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:53:16,472 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:16,477 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume 0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296);init_#res#1 := 0;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:16,478 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:16,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash 362066584, now seen corresponding path program 1 times [2025-02-06 19:53:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961842931] [2025-02-06 19:53:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:16,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:53:16,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:53:16,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:16,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961842931] [2025-02-06 19:53:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961842931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:53:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791326017] [2025-02-06 19:53:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:16,789 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:53:16,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash -503351434, now seen corresponding path program 1 times [2025-02-06 19:53:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:16,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598942224] [2025-02-06 19:53:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:16,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:53:16,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:53:16,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:16,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598942224] [2025-02-06 19:53:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598942224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942301886] [2025-02-06 19:53:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:16,929 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:16,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:53:16,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:53:16,969 INFO L87 Difference]: Start difference. First operand has 274 states, 273 states have (on average 1.564102564102564) internal successors, (427), 273 states have internal predecessors, (427), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2025-02-06 19:53:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:17,037 INFO L93 Difference]: Finished difference Result 250 states and 377 transitions. [2025-02-06 19:53:17,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 377 transitions. [2025-02-06 19:53:17,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2025-02-06 19:53:17,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 225 states and 341 transitions. [2025-02-06 19:53:17,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-02-06 19:53:17,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2025-02-06 19:53:17,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 341 transitions. [2025-02-06 19:53:17,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:17,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 341 transitions. [2025-02-06 19:53:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 341 transitions. [2025-02-06 19:53:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-06 19:53:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 224 states have internal predecessors, (341), 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) [2025-02-06 19:53:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 341 transitions. [2025-02-06 19:53:17,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 225 states and 341 transitions. [2025-02-06 19:53:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:53:17,097 INFO L432 stractBuchiCegarLoop]: Abstraction has 225 states and 341 transitions. [2025-02-06 19:53:17,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:53:17,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 341 transitions. [2025-02-06 19:53:17,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2025-02-06 19:53:17,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:17,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:17,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,105 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:17,105 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 1 times [2025-02-06 19:53:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466170711] [2025-02-06 19:53:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:17,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash -503351434, now seen corresponding path program 2 times [2025-02-06 19:53:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135181170] [2025-02-06 19:53:17,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:53:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:53:17,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:53:17,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:53:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135181170] [2025-02-06 19:53:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135181170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196330417] [2025-02-06 19:53:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:17,279 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:17,280 INFO L87 Difference]: Start difference. First operand 225 states and 341 transitions. cyclomatic complexity: 117 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-02-06 19:53:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:17,314 INFO L93 Difference]: Finished difference Result 420 states and 642 transitions. [2025-02-06 19:53:17,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 420 states and 642 transitions. [2025-02-06 19:53:17,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 403 [2025-02-06 19:53:17,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 420 states to 420 states and 642 transitions. [2025-02-06 19:53:17,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-02-06 19:53:17,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2025-02-06 19:53:17,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 420 states and 642 transitions. [2025-02-06 19:53:17,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:17,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 420 states and 642 transitions. [2025-02-06 19:53:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states and 642 transitions. [2025-02-06 19:53:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 255. [2025-02-06 19:53:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 1.5215686274509803) internal successors, (388), 254 states have internal predecessors, (388), 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) [2025-02-06 19:53:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2025-02-06 19:53:17,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 388 transitions. [2025-02-06 19:53:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:17,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 388 transitions. [2025-02-06 19:53:17,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:53:17,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 388 transitions. [2025-02-06 19:53:17,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 238 [2025-02-06 19:53:17,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:17,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:17,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,336 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:17,336 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume 0 == ~side2Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 2 times [2025-02-06 19:53:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96357451] [2025-02-06 19:53:17,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:53:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:53:17,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:17,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 930191384, now seen corresponding path program 1 times [2025-02-06 19:53:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334118570] [2025-02-06 19:53:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 19:53:17,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:53:17,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334118570] [2025-02-06 19:53:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334118570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773060912] [2025-02-06 19:53:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:17,502 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:17,503 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2025-02-06 19:53:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:17,533 INFO L93 Difference]: Finished difference Result 469 states and 718 transitions. [2025-02-06 19:53:17,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 718 transitions. [2025-02-06 19:53:17,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 452 [2025-02-06 19:53:17,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 469 states and 718 transitions. [2025-02-06 19:53:17,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 469 [2025-02-06 19:53:17,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 469 [2025-02-06 19:53:17,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 718 transitions. [2025-02-06 19:53:17,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:17,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 469 states and 718 transitions. [2025-02-06 19:53:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 718 transitions. [2025-02-06 19:53:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 290. [2025-02-06 19:53:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.5241379310344827) internal successors, (442), 289 states have internal predecessors, (442), 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) [2025-02-06 19:53:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 442 transitions. [2025-02-06 19:53:17,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 290 states and 442 transitions. [2025-02-06 19:53:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:17,559 INFO L432 stractBuchiCegarLoop]: Abstraction has 290 states and 442 transitions. [2025-02-06 19:53:17,559 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:53:17,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 442 transitions. [2025-02-06 19:53:17,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2025-02-06 19:53:17,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:17,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:17,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,562 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:17,562 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume 0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_0~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:17,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 3 times [2025-02-06 19:53:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964678092] [2025-02-06 19:53:17,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:53:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:53:17,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash 521367159, now seen corresponding path program 1 times [2025-02-06 19:53:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676476406] [2025-02-06 19:53:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 19:53:17,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:53:17,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676476406] [2025-02-06 19:53:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676476406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546630855] [2025-02-06 19:53:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:17,756 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:17,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:17,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:17,758 INFO L87 Difference]: Start difference. First operand 290 states and 442 transitions. cyclomatic complexity: 153 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2025-02-06 19:53:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:17,779 INFO L93 Difference]: Finished difference Result 287 states and 436 transitions. [2025-02-06 19:53:17,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 436 transitions. [2025-02-06 19:53:17,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2025-02-06 19:53:17,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 287 states and 436 transitions. [2025-02-06 19:53:17,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2025-02-06 19:53:17,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2025-02-06 19:53:17,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 436 transitions. [2025-02-06 19:53:17,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:17,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 287 states and 436 transitions. [2025-02-06 19:53:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 436 transitions. [2025-02-06 19:53:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-02-06 19:53:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 287 states have (on average 1.519163763066202) internal successors, (436), 286 states have internal predecessors, (436), 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) [2025-02-06 19:53:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 436 transitions. [2025-02-06 19:53:17,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 287 states and 436 transitions. [2025-02-06 19:53:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:17,820 INFO L432 stractBuchiCegarLoop]: Abstraction has 287 states and 436 transitions. [2025-02-06 19:53:17,820 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:53:17,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 436 transitions. [2025-02-06 19:53:17,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 270 [2025-02-06 19:53:17,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:17,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:17,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:17,823 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:17,823 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume 0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 4 times [2025-02-06 19:53:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107461197] [2025-02-06 19:53:17,825 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:53:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-06 19:53:17,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:53:17,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:17,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:17,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:17,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:17,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1015436364, now seen corresponding path program 1 times [2025-02-06 19:53:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997374815] [2025-02-06 19:53:17,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:17,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:53:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:53:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997374815] [2025-02-06 19:53:17,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997374815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:17,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:17,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347582169] [2025-02-06 19:53:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:17,965 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:17,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:17,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:17,965 INFO L87 Difference]: Start difference. First operand 287 states and 436 transitions. cyclomatic complexity: 150 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2025-02-06 19:53:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:18,019 INFO L93 Difference]: Finished difference Result 275 states and 412 transitions. [2025-02-06 19:53:18,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 412 transitions. [2025-02-06 19:53:18,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2025-02-06 19:53:18,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 412 transitions. [2025-02-06 19:53:18,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2025-02-06 19:53:18,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2025-02-06 19:53:18,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 412 transitions. [2025-02-06 19:53:18,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:18,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-02-06 19:53:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 412 transitions. [2025-02-06 19:53:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-06 19:53:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 275 states have (on average 1.4981818181818183) internal successors, (412), 274 states have internal predecessors, (412), 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) [2025-02-06 19:53:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2025-02-06 19:53:18,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-02-06 19:53:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:18,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-02-06 19:53:18,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:53:18,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 412 transitions. [2025-02-06 19:53:18,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2025-02-06 19:53:18,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:18,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:18,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,040 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:18,040 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume 0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 5 times [2025-02-06 19:53:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462507579] [2025-02-06 19:53:18,041 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:53:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,051 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:53:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1306335811, now seen corresponding path program 1 times [2025-02-06 19:53:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146750381] [2025-02-06 19:53:18,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:53:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:53:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146750381] [2025-02-06 19:53:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146750381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645965995] [2025-02-06 19:53:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:18,211 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:18,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:18,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:18,211 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. cyclomatic complexity: 138 Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2025-02-06 19:53:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:18,267 INFO L93 Difference]: Finished difference Result 263 states and 388 transitions. [2025-02-06 19:53:18,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 388 transitions. [2025-02-06 19:53:18,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 246 [2025-02-06 19:53:18,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 263 states and 388 transitions. [2025-02-06 19:53:18,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-02-06 19:53:18,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-02-06 19:53:18,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 388 transitions. [2025-02-06 19:53:18,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:18,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 263 states and 388 transitions. [2025-02-06 19:53:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 388 transitions. [2025-02-06 19:53:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-02-06 19:53:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 262 states have internal predecessors, (388), 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) [2025-02-06 19:53:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2025-02-06 19:53:18,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 263 states and 388 transitions. [2025-02-06 19:53:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:18,281 INFO L432 stractBuchiCegarLoop]: Abstraction has 263 states and 388 transitions. [2025-02-06 19:53:18,281 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:53:18,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 388 transitions. [2025-02-06 19:53:18,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 246 [2025-02-06 19:53:18,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:18,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:18,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,283 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:18,283 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume 0 == check_~tmp___8~0#1 % 256;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret17#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___5~0#1 := check_#t~ret17#1;havoc check_#t~ret17#1;" "assume !(2 == check_~tmp___5~0#1);check_#res#1 := 0;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 6 times [2025-02-06 19:53:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000276193] [2025-02-06 19:53:18,284 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:53:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,293 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:53:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:18,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash -554722580, now seen corresponding path program 1 times [2025-02-06 19:53:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610710265] [2025-02-06 19:53:18,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:53:18,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:53:18,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610710265] [2025-02-06 19:53:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610710265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:18,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:53:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524942824] [2025-02-06 19:53:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:18,543 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:18,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:18,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:53:18,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:53:18,545 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. cyclomatic complexity: 126 Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-02-06 19:53:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:18,592 INFO L93 Difference]: Finished difference Result 249 states and 357 transitions. [2025-02-06 19:53:18,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 357 transitions. [2025-02-06 19:53:18,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-02-06 19:53:18,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 231 states and 332 transitions. [2025-02-06 19:53:18,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-02-06 19:53:18,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2025-02-06 19:53:18,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 332 transitions. [2025-02-06 19:53:18,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:18,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 332 transitions. [2025-02-06 19:53:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 332 transitions. [2025-02-06 19:53:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-06 19:53:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.4372294372294372) internal successors, (332), 230 states have internal predecessors, (332), 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) [2025-02-06 19:53:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 332 transitions. [2025-02-06 19:53:18,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 231 states and 332 transitions. [2025-02-06 19:53:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:53:18,604 INFO L432 stractBuchiCegarLoop]: Abstraction has 231 states and 332 transitions. [2025-02-06 19:53:18,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:53:18,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 332 transitions. [2025-02-06 19:53:18,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-02-06 19:53:18,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:18,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:18,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,606 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:18,607 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 7 times [2025-02-06 19:53:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738370824] [2025-02-06 19:53:18,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:53:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:18,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:18,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1559127887, now seen corresponding path program 1 times [2025-02-06 19:53:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068278006] [2025-02-06 19:53:18,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:53:18,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:53:18,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068278006] [2025-02-06 19:53:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068278006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:53:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243776164] [2025-02-06 19:53:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:18,791 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:18,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:53:18,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:53:18,793 INFO L87 Difference]: Start difference. First operand 231 states and 332 transitions. cyclomatic complexity: 102 Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2025-02-06 19:53:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:18,935 INFO L93 Difference]: Finished difference Result 463 states and 665 transitions. [2025-02-06 19:53:18,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 463 states and 665 transitions. [2025-02-06 19:53:18,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 446 [2025-02-06 19:53:18,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 463 states to 463 states and 665 transitions. [2025-02-06 19:53:18,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-02-06 19:53:18,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2025-02-06 19:53:18,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 463 states and 665 transitions. [2025-02-06 19:53:18,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:18,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 463 states and 665 transitions. [2025-02-06 19:53:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states and 665 transitions. [2025-02-06 19:53:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 324. [2025-02-06 19:53:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 324 states have (on average 1.404320987654321) internal successors, (455), 323 states have internal predecessors, (455), 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) [2025-02-06 19:53:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 455 transitions. [2025-02-06 19:53:18,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 324 states and 455 transitions. [2025-02-06 19:53:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:53:18,949 INFO L432 stractBuchiCegarLoop]: Abstraction has 324 states and 455 transitions. [2025-02-06 19:53:18,949 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:53:18,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 455 transitions. [2025-02-06 19:53:18,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2025-02-06 19:53:18,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:18,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:18,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:18,951 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:18,951 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume !(1 == Pendulum_prism_task_each_pals_period_~side1~2#1);" "assume 1 == Pendulum_prism_task_each_pals_period_~side2~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 2;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 8 times [2025-02-06 19:53:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562495463] [2025-02-06 19:53:18,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:53:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:53:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:18,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:18,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:18,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:18,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:18,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash -589016511, now seen corresponding path program 1 times [2025-02-06 19:53:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309577730] [2025-02-06 19:53:18,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:18,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 19:53:19,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 19:53:19,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309577730] [2025-02-06 19:53:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309577730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:53:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324931175] [2025-02-06 19:53:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:19,125 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:19,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:53:19,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:53:19,126 INFO L87 Difference]: Start difference. First operand 324 states and 455 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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) [2025-02-06 19:53:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:19,258 INFO L93 Difference]: Finished difference Result 560 states and 792 transitions. [2025-02-06 19:53:19,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 560 states and 792 transitions. [2025-02-06 19:53:19,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 543 [2025-02-06 19:53:19,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 560 states to 560 states and 792 transitions. [2025-02-06 19:53:19,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 560 [2025-02-06 19:53:19,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 560 [2025-02-06 19:53:19,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 560 states and 792 transitions. [2025-02-06 19:53:19,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:19,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 560 states and 792 transitions. [2025-02-06 19:53:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states and 792 transitions. [2025-02-06 19:53:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 324. [2025-02-06 19:53:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 324 states have (on average 1.404320987654321) internal successors, (455), 323 states have internal predecessors, (455), 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) [2025-02-06 19:53:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 455 transitions. [2025-02-06 19:53:19,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 324 states and 455 transitions. [2025-02-06 19:53:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:53:19,270 INFO L432 stractBuchiCegarLoop]: Abstraction has 324 states and 455 transitions. [2025-02-06 19:53:19,270 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:53:19,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 455 transitions. [2025-02-06 19:53:19,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2025-02-06 19:53:19,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:19,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:19,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,273 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:19,273 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_1~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 9 times [2025-02-06 19:53:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973612873] [2025-02-06 19:53:19,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:53:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:19,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:53:19,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:19,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:19,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1667352448, now seen corresponding path program 1 times [2025-02-06 19:53:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939627394] [2025-02-06 19:53:19,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 19:53:19,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 19:53:19,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:19,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939627394] [2025-02-06 19:53:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939627394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:53:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865952689] [2025-02-06 19:53:19,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:19,389 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:19,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:53:19,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:53:19,390 INFO L87 Difference]: Start difference. First operand 324 states and 455 transitions. cyclomatic complexity: 132 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2025-02-06 19:53:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:19,436 INFO L93 Difference]: Finished difference Result 322 states and 450 transitions. [2025-02-06 19:53:19,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 450 transitions. [2025-02-06 19:53:19,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2025-02-06 19:53:19,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 322 states and 450 transitions. [2025-02-06 19:53:19,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2025-02-06 19:53:19,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2025-02-06 19:53:19,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 450 transitions. [2025-02-06 19:53:19,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:19,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 322 states and 450 transitions. [2025-02-06 19:53:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 450 transitions. [2025-02-06 19:53:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 231. [2025-02-06 19:53:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.4285714285714286) internal successors, (330), 230 states have internal predecessors, (330), 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) [2025-02-06 19:53:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 330 transitions. [2025-02-06 19:53:19,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 231 states and 330 transitions. [2025-02-06 19:53:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:53:19,446 INFO L432 stractBuchiCegarLoop]: Abstraction has 231 states and 330 transitions. [2025-02-06 19:53:19,446 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:53:19,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 330 transitions. [2025-02-06 19:53:19,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2025-02-06 19:53:19,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:19,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:19,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,448 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:19,448 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume !(0 != check_~tmp___7~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:19,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 10 times [2025-02-06 19:53:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686222906] [2025-02-06 19:53:19,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:53:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-06 19:53:19,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:53:19,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:19,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:19,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:19,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1568890196, now seen corresponding path program 1 times [2025-02-06 19:53:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173424249] [2025-02-06 19:53:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 19:53:19,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:53:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173424249] [2025-02-06 19:53:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173424249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 19:53:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025829661] [2025-02-06 19:53:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:19,804 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:19,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:53:19,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:53:19,806 INFO L87 Difference]: Start difference. First operand 231 states and 330 transitions. cyclomatic complexity: 100 Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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) [2025-02-06 19:53:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:19,938 INFO L93 Difference]: Finished difference Result 299 states and 418 transitions. [2025-02-06 19:53:19,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 418 transitions. [2025-02-06 19:53:19,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2025-02-06 19:53:19,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 299 states and 418 transitions. [2025-02-06 19:53:19,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2025-02-06 19:53:19,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2025-02-06 19:53:19,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 418 transitions. [2025-02-06 19:53:19,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:19,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 299 states and 418 transitions. [2025-02-06 19:53:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 418 transitions. [2025-02-06 19:53:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 236. [2025-02-06 19:53:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 236 states have (on average 1.4194915254237288) internal successors, (335), 235 states have internal predecessors, (335), 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) [2025-02-06 19:53:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2025-02-06 19:53:19,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 236 states and 335 transitions. [2025-02-06 19:53:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:53:19,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 236 states and 335 transitions. [2025-02-06 19:53:19,946 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:53:19,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 335 transitions. [2025-02-06 19:53:19,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2025-02-06 19:53:19,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:19,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:19,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:19,947 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:19,947 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume 0 != ~side1Failed~0 % 256;~s1s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s1p_new~0) % 256 - 256);~side1_written~0 := ~nomsg~0;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume !(0 == ~side1Failed~0 % 256);" "assume !(0 == ~side2Failed~0 % 256);check_~tmp~3#1 := 0;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume !(0 == check_~tmp___8~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 11 times [2025-02-06 19:53:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284624001] [2025-02-06 19:53:19,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:53:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:19,963 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,963 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:53:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:19,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:19,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 859146721, now seen corresponding path program 1 times [2025-02-06 19:53:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231127947] [2025-02-06 19:53:19,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:19,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:53:19,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:53:19,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:19,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231127947] [2025-02-06 19:53:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231127947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:53:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023586631] [2025-02-06 19:53:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:20,099 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:53:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:53:20,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:53:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:53:20,099 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. cyclomatic complexity: 100 Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2025-02-06 19:53:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:53:20,114 INFO L93 Difference]: Finished difference Result 238 states and 336 transitions. [2025-02-06 19:53:20,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 336 transitions. [2025-02-06 19:53:20,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 203 [2025-02-06 19:53:20,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 220 states and 308 transitions. [2025-02-06 19:53:20,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2025-02-06 19:53:20,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2025-02-06 19:53:20,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 308 transitions. [2025-02-06 19:53:20,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:53:20,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 220 states and 308 transitions. [2025-02-06 19:53:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 308 transitions. [2025-02-06 19:53:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-06 19:53:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 220 states have (on average 1.4) internal successors, (308), 219 states have internal predecessors, (308), 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) [2025-02-06 19:53:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 308 transitions. [2025-02-06 19:53:20,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 220 states and 308 transitions. [2025-02-06 19:53:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:53:20,120 INFO L432 stractBuchiCegarLoop]: Abstraction has 220 states and 308 transitions. [2025-02-06 19:53:20,120 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:53:20,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 308 transitions. [2025-02-06 19:53:20,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 203 [2025-02-06 19:53:20,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:53:20,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:53:20,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:20,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:53:20,122 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~cs1~0 := 0;~cs1_old~0 := 0;~cs1_new~0 := 0;~cs2~0 := 0;~cs2_old~0 := 0;~cs2_new~0 := 0;~s1s2~0 := 0;~s1s2_old~0 := 0;~s1s2_new~0 := 0;~s1s1~0 := 0;~s1s1_old~0 := 0;~s1s1_new~0 := 0;~s2s1~0 := 0;~s2s1_old~0 := 0;~s2s1_new~0 := 0;~s2s2~0 := 0;~s2s2_old~0 := 0;~s2s2_new~0 := 0;~s1p~0 := 0;~s1p_old~0 := 0;~s1p_new~0 := 0;~s2p~0 := 0;~s2p_old~0 := 0;~s2p_new~0 := 0;~side1Failed~0 := 0;~side2Failed~0 := 0;~side1_written~0 := 0;~side2_written~0 := 0;~side1Failed_History_0~0 := 0;~side1Failed_History_1~0 := 0;~side1Failed_History_2~0 := 0;~side2Failed_History_0~0 := 0;~side2Failed_History_1~0 := 0;~side2Failed_History_2~0 := 0;~active_side_History_0~0 := 0;~active_side_History_1~0 := 0;~active_side_History_2~0 := 0;~manual_selection_History_0~0 := 0;~manual_selection_History_1~0 := 0;~manual_selection_History_2~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~side1Failed~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;assume 0 == main_#t~nondet32#1 || 1 == main_#t~nondet32#1;~side2Failed~0 := (if 0 == main_#t~nondet32#1 % 256 then 0 else 1);havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~side1_written~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~side2_written~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;assume 0 == main_#t~nondet35#1 || 1 == main_#t~nondet35#1;~side1Failed_History_0~0 := (if 0 == main_#t~nondet35#1 % 256 then 0 else 1);havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~side1Failed_History_1~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~side1Failed_History_2~0 := (if 0 == main_#t~nondet37#1 % 256 then 0 else 1);havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~side2Failed_History_0~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~side2Failed_History_1~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;assume 0 == main_#t~nondet40#1 || 1 == main_#t~nondet40#1;~side2Failed_History_2~0 := (if 0 == main_#t~nondet40#1 % 256 then 0 else 1);havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~active_side_History_0~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~active_side_History_1~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~active_side_History_2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~manual_selection_History_0~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~manual_selection_History_1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;~manual_selection_History_2~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;" "assume !(0 != (if ~side1Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_0~0 % 256 % 4294967296 else ~side1Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_0~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_0~0 % 256 % 4294967296 else ~side2Failed_History_0~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_0~0);" "assume !(0 != ~manual_selection_History_0~0);" "assume !(0 != (if ~side1Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_1~0 % 256 % 4294967296 else ~side1Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_1~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_1~0 % 256 % 4294967296 else ~side2Failed_History_1~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_1~0);" "assume !(0 != ~manual_selection_History_1~0);" "assume !(0 != (if ~side1Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side1Failed_History_2~0 % 256 % 4294967296 else ~side1Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(0 != (if ~side2Failed_History_2~0 % 256 % 4294967296 <= 2147483647 then ~side2Failed_History_2~0 % 256 % 4294967296 else ~side2Failed_History_2~0 % 256 % 4294967296 - 4294967296));" "assume !(-2 != ~active_side_History_2~0);" "assume !(0 != ~manual_selection_History_2~0);init_#res#1 := 1;" "main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~cs1_old~0 := ~nomsg~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~nomsg~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~nomsg~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~nomsg~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~nomsg~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~nomsg~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~nomsg~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~nomsg~0;~s2p_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2025-02-06 19:53:20,122 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_Console_task_each_pals_period } true;havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_~manual_selection~0#1;havoc Console_task_each_pals_period_~tmp~1#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~tmp~1#1 := Console_task_each_pals_period_#t~nondet4#1;havoc Console_task_each_pals_period_#t~nondet4#1;Console_task_each_pals_period_~manual_selection~0#1 := Console_task_each_pals_period_~tmp~1#1;assume { :begin_inline_write_manual_selection_history } true;write_manual_selection_history_#in~val#1 := Console_task_each_pals_period_~manual_selection~0#1;havoc write_manual_selection_history_~val#1;write_manual_selection_history_~val#1 := write_manual_selection_history_#in~val#1;~manual_selection_History_2~0 := ~manual_selection_History_1~0;~manual_selection_History_1~0 := ~manual_selection_History_0~0;~manual_selection_History_0~0 := write_manual_selection_history_~val#1;" "havoc write_manual_selection_history_~val#1;havoc write_manual_selection_history_#in~val#1;assume { :end_inline_write_manual_selection_history } true;~cs1_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs1_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs1_new~0) % 256 - 256);~cs2_new~0 := (if (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 <= 127 then (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 else (if Console_task_each_pals_period_~manual_selection~0#1 != ~nomsg~0 && ~cs2_new~0 == ~nomsg~0 then Console_task_each_pals_period_~manual_selection~0#1 else ~cs2_new~0) % 256 - 256);Console_task_each_pals_period_~manual_selection~0#1 := 0;" "havoc Console_task_each_pals_period_#t~nondet4#1, Console_task_each_pals_period_~manual_selection~0#1, Console_task_each_pals_period_~tmp~1#1;assume { :end_inline_Console_task_each_pals_period } true;assume { :begin_inline_Side1_activestandby_task_each_pals_period } true;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;havoc Side1_activestandby_task_each_pals_period_~side1~0#1;havoc Side1_activestandby_task_each_pals_period_~side2~0#1;havoc Side1_activestandby_task_each_pals_period_~manual_selection~1#1;havoc Side1_activestandby_task_each_pals_period_~next_state~0#1;Side1_activestandby_task_each_pals_period_~side1~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := 0;havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 || 1 == Side1_activestandby_task_each_pals_period_#t~nondet5#1;~side1Failed~0 := (if 0 == Side1_activestandby_task_each_pals_period_#t~nondet5#1 % 256 then 0 else 1);havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1;assume { :begin_inline_write_side1_failed_history } true;write_side1_failed_history_#in~val#1 := (if 0 == ~side1Failed~0 % 256 then 0 else 1);havoc write_side1_failed_history_~val#1;write_side1_failed_history_~val#1 := write_side1_failed_history_#in~val#1;~side1Failed_History_2~0 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);~side1Failed_History_1~0 := (if 0 == ~side1Failed_History_0~0 % 256 then 0 else 1);~side1Failed_History_0~0 := (if 0 == write_side1_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side1_failed_history_~val#1;havoc write_side1_failed_history_#in~val#1;assume { :end_inline_write_side1_failed_history } true;" "assume !(0 != ~side1Failed~0 % 256);Side1_activestandby_task_each_pals_period_~side1~0#1 := ~s1s1_old~0;~s1s1_old~0 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~side2~0#1 := ~s2s1_old~0;~s2s1_old~0 := ~nomsg~0;Side1_activestandby_task_each_pals_period_~manual_selection~1#1 := ~cs1_old~0;~cs1_old~0 := ~nomsg~0;" "assume Side1_activestandby_task_each_pals_period_~side1~0#1 == Side1_activestandby_task_each_pals_period_~side2~0#1;Side1_activestandby_task_each_pals_period_~next_state~0#1 := 1;" "~s1s1_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s1_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s1_new~0) % 256 - 256);~s1s2_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1s2_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1s2_new~0) % 256 - 256);~s1p_new~0 := (if (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 <= 127 then (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 else (if Side1_activestandby_task_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~s1p_new~0 == ~nomsg~0 then Side1_activestandby_task_each_pals_period_~next_state~0#1 else ~s1p_new~0) % 256 - 256);~side1_written~0 := Side1_activestandby_task_each_pals_period_~next_state~0#1;" "havoc Side1_activestandby_task_each_pals_period_#t~nondet5#1, Side1_activestandby_task_each_pals_period_#t~ret6#1, Side1_activestandby_task_each_pals_period_~side1~0#1, Side1_activestandby_task_each_pals_period_~side2~0#1, Side1_activestandby_task_each_pals_period_~manual_selection~1#1, Side1_activestandby_task_each_pals_period_~next_state~0#1;assume { :end_inline_Side1_activestandby_task_each_pals_period } true;assume { :begin_inline_Side2_activestandby_task_each_pals_period } true;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;havoc Side2_activestandby_task_each_pals_period_~side1~1#1;havoc Side2_activestandby_task_each_pals_period_~side2~1#1;havoc Side2_activestandby_task_each_pals_period_~manual_selection~2#1;havoc Side2_activestandby_task_each_pals_period_~next_state~1#1;Side2_activestandby_task_each_pals_period_~side1~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~side2~1#1 := ~nomsg~0;Side2_activestandby_task_each_pals_period_~manual_selection~2#1 := 0;havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 || 1 == Side2_activestandby_task_each_pals_period_#t~nondet7#1;~side2Failed~0 := (if 0 == Side2_activestandby_task_each_pals_period_#t~nondet7#1 % 256 then 0 else 1);havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1;assume { :begin_inline_write_side2_failed_history } true;write_side2_failed_history_#in~val#1 := (if 0 == ~side2Failed~0 % 256 then 0 else 1);havoc write_side2_failed_history_~val#1;write_side2_failed_history_~val#1 := write_side2_failed_history_#in~val#1;~side2Failed_History_2~0 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);~side2Failed_History_1~0 := (if 0 == ~side2Failed_History_0~0 % 256 then 0 else 1);~side2Failed_History_0~0 := (if 0 == write_side2_failed_history_~val#1 % 256 then 0 else 1);" "havoc write_side2_failed_history_~val#1;havoc write_side2_failed_history_#in~val#1;assume { :end_inline_write_side2_failed_history } true;" "assume 0 != ~side2Failed~0 % 256;~s2s1_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s1_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s1_new~0) % 256 - 256);~s2s2_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2s2_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2s2_new~0) % 256 - 256);~s2p_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~s2p_new~0 == ~nomsg~0 then ~nomsg~0 else ~s2p_new~0) % 256 - 256);~side2_written~0 := ~nomsg~0;" "havoc Side2_activestandby_task_each_pals_period_#t~nondet7#1, Side2_activestandby_task_each_pals_period_#t~ret8#1, Side2_activestandby_task_each_pals_period_~side1~1#1, Side2_activestandby_task_each_pals_period_~side2~1#1, Side2_activestandby_task_each_pals_period_~manual_selection~2#1, Side2_activestandby_task_each_pals_period_~next_state~1#1;assume { :end_inline_Side2_activestandby_task_each_pals_period } true;assume { :begin_inline_Pendulum_prism_task_each_pals_period } true;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;havoc Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc Pendulum_prism_task_each_pals_period_~tmp~2#1;havoc Pendulum_prism_task_each_pals_period_~side1~2#1;havoc Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 0;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume 0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_0~0;" "Pendulum_prism_task_each_pals_period_#t~ret9#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;Pendulum_prism_task_each_pals_period_~tmp~2#1 := Pendulum_prism_task_each_pals_period_#t~ret9#1;havoc Pendulum_prism_task_each_pals_period_#t~ret9#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := Pendulum_prism_task_each_pals_period_~tmp~2#1;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side1~2#1 := ~s1p_old~0;~s1p_old~0 := ~nomsg~0;Pendulum_prism_task_each_pals_period_~side2~2#1 := ~s2p_old~0;~s2p_old~0 := ~nomsg~0;" "assume 1 == Pendulum_prism_task_each_pals_period_~side1~2#1;Pendulum_prism_task_each_pals_period_~active_side~0#1 := 1;" "assume { :begin_inline_write_active_side_history } true;write_active_side_history_#in~val#1 := Pendulum_prism_task_each_pals_period_~active_side~0#1;havoc write_active_side_history_~val#1;write_active_side_history_~val#1 := write_active_side_history_#in~val#1;~active_side_History_2~0 := ~active_side_History_1~0;~active_side_History_1~0 := ~active_side_History_0~0;~active_side_History_0~0 := write_active_side_history_~val#1;" "havoc write_active_side_history_~val#1;havoc write_active_side_history_#in~val#1;assume { :end_inline_write_active_side_history } true;" "havoc Pendulum_prism_task_each_pals_period_#t~ret9#1, Pendulum_prism_task_each_pals_period_~active_side~0#1, Pendulum_prism_task_each_pals_period_~tmp~2#1, Pendulum_prism_task_each_pals_period_~side1~2#1, Pendulum_prism_task_each_pals_period_~side2~2#1;assume { :end_inline_Pendulum_prism_task_each_pals_period } true;~cs1_old~0 := ~cs1_new~0;~cs1_new~0 := ~nomsg~0;~cs2_old~0 := ~cs2_new~0;~cs2_new~0 := ~nomsg~0;~s1s2_old~0 := ~s1s2_new~0;~s1s2_new~0 := ~nomsg~0;~s1s1_old~0 := ~s1s1_new~0;~s1s1_new~0 := ~nomsg~0;~s2s1_old~0 := ~s2s1_new~0;~s2s1_new~0 := ~nomsg~0;~s2s2_old~0 := ~s2s2_new~0;~s2s2_new~0 := ~nomsg~0;~s1p_old~0 := ~s1p_new~0;~s1p_new~0 := ~nomsg~0;~s2p_old~0 := ~s2p_new~0;~s2p_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;havoc check_~tmp~3#1;havoc check_~tmp___0~0#1;havoc check_~tmp___1~0#1;havoc check_~tmp___2~0#1;havoc check_~tmp___3~0#1;havoc check_~tmp___4~0#1;havoc check_~tmp___5~0#1;havoc check_~tmp___6~0#1;havoc check_~tmp___7~0#1;havoc check_~tmp___8~0#1;havoc check_~tmp___9~0#1;havoc check_~tmp___10~0#1;havoc check_~tmp___11~0#1;havoc check_~tmp___12~0#1;havoc check_~tmp___13~0#1;havoc check_~tmp___14~0#1;havoc check_~tmp___15~0#1;havoc check_~tmp___16~0#1;havoc check_~tmp___17~0#1;havoc check_~tmp___18~0#1;havoc check_~tmp___19~0#1;havoc check_~tmp___20~0#1;" "assume 0 == ~side1Failed~0 % 256;check_~tmp~3#1 := 1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 <= 2147483647 then (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 else (if 0 == check_~tmp~3#1 then 0 else 1) % 256 % 4294967296 - 4294967296);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_read_manual_selection_history } true;read_manual_selection_history_#in~index#1 := 1;havoc read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;read_manual_selection_history_~index#1 := read_manual_selection_history_#in~index#1;" "assume !(0 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_manual_selection_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_manual_selection_history_~index#1 % 256 % 4294967296 else read_manual_selection_history_~index#1 % 256 % 4294967296 - 4294967296);read_manual_selection_history_#res#1 := ~manual_selection_History_1~0;" "check_#t~ret10#1 := read_manual_selection_history_#res#1;havoc read_manual_selection_history_~index#1;havoc read_manual_selection_history_#in~index#1;assume { :end_inline_read_manual_selection_history } true;check_~tmp___0~0#1 := check_#t~ret10#1;havoc check_#t~ret10#1;" "assume !(0 == check_~tmp___0~0#1);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret15#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___7~0#1 := (if 0 == check_#t~ret15#1 % 256 then 0 else 1);havoc check_#t~ret15#1;" "assume 0 != check_~tmp___7~0#1 % 256;assume { :begin_inline_read_side2_failed_history } true;read_side2_failed_history_#in~index#1 := 1;havoc read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;read_side2_failed_history_~index#1 := read_side2_failed_history_#in~index#1;" "assume !(0 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side2_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side2_failed_history_~index#1 % 256 % 4294967296 else read_side2_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side2_failed_history_#res#1 := (if 0 == ~side2Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret16#1 := read_side2_failed_history_#res#1;havoc read_side2_failed_history_~index#1;havoc read_side2_failed_history_#in~index#1;assume { :end_inline_read_side2_failed_history } true;check_~tmp___8~0#1 := (if 0 == check_#t~ret16#1 % 256 then 0 else 1);havoc check_#t~ret16#1;" "assume !(0 == check_~tmp___8~0#1 % 256);" "assume { :begin_inline_read_side1_failed_history } true;read_side1_failed_history_#in~index#1 := 1;havoc read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;read_side1_failed_history_~index#1 := read_side1_failed_history_#in~index#1;" "assume !(0 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 1 == (if read_side1_failed_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_side1_failed_history_~index#1 % 256 % 4294967296 else read_side1_failed_history_~index#1 % 256 % 4294967296 - 4294967296);read_side1_failed_history_#res#1 := (if 0 == ~side1Failed_History_1~0 % 256 then 0 else 1);" "check_#t~ret19#1 := read_side1_failed_history_#res#1;havoc read_side1_failed_history_~index#1;havoc read_side1_failed_history_#in~index#1;assume { :end_inline_read_side1_failed_history } true;check_~tmp___11~0#1 := (if 0 == check_#t~ret19#1 % 256 then 0 else 1);havoc check_#t~ret19#1;" "assume !(0 == check_~tmp___11~0#1 % 256);" "assume { :begin_inline_read_active_side_history } true;read_active_side_history_#in~index#1 := 2;havoc read_active_side_history_#res#1;havoc read_active_side_history_~index#1;read_active_side_history_~index#1 := read_active_side_history_#in~index#1;" "assume !(0 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume !(1 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296));" "assume 2 == (if read_active_side_history_~index#1 % 256 % 4294967296 <= 2147483647 then read_active_side_history_~index#1 % 256 % 4294967296 else read_active_side_history_~index#1 % 256 % 4294967296 - 4294967296);read_active_side_history_#res#1 := ~active_side_History_2~0;" "check_#t~ret23#1 := read_active_side_history_#res#1;havoc read_active_side_history_~index#1;havoc read_active_side_history_#in~index#1;assume { :end_inline_read_active_side_history } true;check_~tmp___20~0#1 := check_#t~ret23#1;havoc check_#t~ret23#1;" "assume !(check_~tmp___20~0#1 > -2);" "check_#res#1 := 1;" "main_#t~ret48#1 := check_#res#1;havoc check_#t~ret10#1, check_#t~ret11#1, check_#t~ret12#1, check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~ret17#1, check_#t~ret18#1, check_#t~ret19#1, check_#t~ret20#1, check_#t~ret21#1, check_#t~ret22#1, check_#t~ret23#1, check_#t~ret24#1, check_#t~ret25#1, check_#t~ret26#1, check_#t~ret27#1, check_#t~ret28#1, check_#t~ret29#1, check_#t~ret30#1, check_~tmp~3#1, check_~tmp___0~0#1, check_~tmp___1~0#1, check_~tmp___2~0#1, check_~tmp___3~0#1, check_~tmp___4~0#1, check_~tmp___5~0#1, check_~tmp___6~0#1, check_~tmp___7~0#1, check_~tmp___8~0#1, check_~tmp___9~0#1, check_~tmp___10~0#1, check_~tmp___11~0#1, check_~tmp___12~0#1, check_~tmp___13~0#1, check_~tmp___14~0#1, check_~tmp___15~0#1, check_~tmp___16~0#1, check_~tmp___17~0#1, check_~tmp___18~0#1, check_~tmp___19~0#1, check_~tmp___20~0#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;" [2025-02-06 19:53:20,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -665535718, now seen corresponding path program 12 times [2025-02-06 19:53:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846185855] [2025-02-06 19:53:20,123 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:53:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:20,128 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:20,133 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:20,133 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:53:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:20,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:53:20,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:53:20,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:20,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:20,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1612806049, now seen corresponding path program 1 times [2025-02-06 19:53:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628219811] [2025-02-06 19:53:20,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:20,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:53:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:53:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:20,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:53:20,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:53:20,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:53:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:53:20,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:53:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:53:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1875421784, now seen corresponding path program 1 times [2025-02-06 19:53:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:53:20,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208588757] [2025-02-06 19:53:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:53:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:53:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:53:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:53:20,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:53:20,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:53:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:53:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:53:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208588757] [2025-02-06 19:53:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208588757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:53:20,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:53:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:53:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272173539] [2025-02-06 19:53:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:53:25,436 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:53:25,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:53:25,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:53:25,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:53:25,438 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:53:25,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:53:25,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:53:25,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:53:25,439 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c_Iteration13_Loop [2025-02-06 19:53:25,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:53:25,439 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:53:25,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:25,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:26,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:53:27,785 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 30