./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 15:05:09,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 15:05:09,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 15:05:09,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 15:05:09,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 15:05:09,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 15:05:09,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 15:05:09,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 15:05:09,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 15:05:09,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 15:05:09,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 15:05:09,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 15:05:09,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 15:05:09,723 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 15:05:09,724 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 15:05:09,724 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 15:05:09,724 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 15:05:09,724 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 15:05:09,724 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 15:05:09,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 15:05:09,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 15:05:09,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 15:05:09,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 15:05:09,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 15:05:09,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 15:05:09,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 15:05:09,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 15:05:09,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 15:05:09,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 15:05:09,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 15:05:09,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 15:05:09,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 15:05:09,730 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 15:05:09,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 15:05:09,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 15:05:09,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 15:05:09,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 15:05:09,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 15:05:09,731 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 15:05:09,732 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2024-11-19 15:05:10,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 15:05:10,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 15:05:10,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 15:05:10,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 15:05:10,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 15:05:10,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-19 15:05:11,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 15:05:11,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 15:05:11,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-19 15:05:11,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fbac4c6/543ae9d8011c426ba578bbfe6fbddb33/FLAG5ae80777b [2024-11-19 15:05:11,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3fbac4c6/543ae9d8011c426ba578bbfe6fbddb33 [2024-11-19 15:05:11,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 15:05:11,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 15:05:11,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 15:05:11,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 15:05:11,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 15:05:11,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:05:11" (1/1) ... [2024-11-19 15:05:11,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c908e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:11, skipping insertion in model container [2024-11-19 15:05:11,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:05:11" (1/1) ... [2024-11-19 15:05:11,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 15:05:12,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:05:12,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 15:05:12,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:05:12,169 INFO L204 MainTranslator]: Completed translation [2024-11-19 15:05:12,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12 WrapperNode [2024-11-19 15:05:12,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 15:05:12,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 15:05:12,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 15:05:12,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 15:05:12,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,264 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 42, calls inlined = 121, statements flattened = 1623 [2024-11-19 15:05:12,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 15:05:12,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 15:05:12,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 15:05:12,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 15:05:12,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,347 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 15:05:12,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 15:05:12,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 15:05:12,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 15:05:12,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 15:05:12,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (1/1) ... [2024-11-19 15:05:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:12,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:12,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 15:05:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 15:05:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 15:05:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 15:05:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 15:05:12,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 15:05:12,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 15:05:14,107 INFO L? ?]: Removed 657 outVars from TransFormulas that were not future-live. [2024-11-19 15:05:14,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 15:05:14,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 15:05:14,147 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 15:05:14,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:05:14 BoogieIcfgContainer [2024-11-19 15:05:14,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 15:05:14,148 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 15:05:14,149 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 15:05:14,152 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 15:05:14,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:05:14,153 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 03:05:11" (1/3) ... [2024-11-19 15:05:14,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4904aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:05:14, skipping insertion in model container [2024-11-19 15:05:14,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:05:14,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:05:12" (2/3) ... [2024-11-19 15:05:14,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4904aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:05:14, skipping insertion in model container [2024-11-19 15:05:14,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:05:14,155 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:05:14" (3/3) ... [2024-11-19 15:05:14,156 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-19 15:05:14,231 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 15:05:14,231 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 15:05:14,231 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 15:05:14,232 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 15:05:14,232 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 15:05:14,232 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 15:05:14,233 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 15:05:14,233 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 15:05:14,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 518 states, 517 states have (on average 1.6615087040618957) internal successors, (859), 517 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:14,281 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 497 [2024-11-19 15:05:14,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:14,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:14,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 15:05:14,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:14,293 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 15:05:14,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 518 states, 517 states have (on average 1.6615087040618957) internal successors, (859), 517 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:14,308 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 497 [2024-11-19 15:05:14,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:14,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:14,309 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 15:05:14,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:14,317 INFO L745 eck$LassoCheckResult]: Stem: 169#$Ultimate##0true 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 435#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 391#L71-2true [2024-11-19 15:05:14,317 INFO L747 eck$LassoCheckResult]: Loop: 391#L71-2true assume !!(add_history_type_~var~0#1 < 3); 317#L72true assume !(0 == add_history_type_~history_id#1); 277#L78true assume !(1 == add_history_type_~history_id#1); 380#L84true assume !(2 == add_history_type_~history_id#1); 384#L90true assume !(3 == add_history_type_~history_id#1); 171#L90-2true add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 391#L71-2true [2024-11-19 15:05:14,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 15:05:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314650934] [2024-11-19 15:05:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:14,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:14,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1279976491, now seen corresponding path program 1 times [2024-11-19 15:05:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910807690] [2024-11-19 15:05:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:14,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:14,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 360025709, now seen corresponding path program 1 times [2024-11-19 15:05:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104691991] [2024-11-19 15:05:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104691991] [2024-11-19 15:05:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104691991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:14,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761242529] [2024-11-19 15:05:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:14,892 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:14,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:14,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:14,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:14,893 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:05:14,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:14,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:14,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:14,894 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2024-11-19 15:05:14,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:14,895 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:14,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:14,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:14,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:15,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:15,081 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:05:15,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 15:05:15,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:15,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:15,118 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:05:15,119 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id#1=7} Honda state: {ULTIMATE.start_add_history_type_~history_id#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:05:15,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 15:05:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 15:05:15,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:15,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:15,148 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:05:15,148 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:05:15,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 15:05:15,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 15:05:15,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:15,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:15,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 15:05:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 15:05:15,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:05:15,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:15,225 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:05:15,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:15,234 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:15,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:15,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:15,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:15,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:05:15,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:15,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:15,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2024-11-19 15:05:15,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:15,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:15,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:15,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:15,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:15,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:15,365 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:05:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 15:05:15,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:15,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:15,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:15,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:15,387 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 15:05:15,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:15,394 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 15:05:15,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:15,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:05:15,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 15:05:15,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,418 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 15:05:15,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:15,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:15,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:15,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:15,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:15,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:15,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:15,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:15,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:05:15,447 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:05:15,447 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:05:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:15,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 15:05:15,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:05:15,481 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:05:15,481 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:05:15,482 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 5 Supporting invariants [] [2024-11-19 15:05:15,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 15:05:15,500 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:05:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:15,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:05:15,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:15,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:05:15,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:15,701 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 15:05:15,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 518 states, 517 states have (on average 1.6615087040618957) internal successors, (859), 517 states have internal predecessors, (859), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:15,853 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 518 states, 517 states have (on average 1.6615087040618957) internal successors, (859), 517 states have internal predecessors, (859), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Result 1088 states and 1810 transitions. Complement of second has 6 states. [2024-11-19 15:05:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:05:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 958 transitions. [2024-11-19 15:05:15,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 958 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-19 15:05:15,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:15,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 958 transitions. Stem has 8 letters. Loop has 6 letters. [2024-11-19 15:05:15,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:15,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 958 transitions. Stem has 2 letters. Loop has 12 letters. [2024-11-19 15:05:15,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:15,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1088 states and 1810 transitions. [2024-11-19 15:05:15,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 437 [2024-11-19 15:05:15,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1088 states to 558 states and 925 transitions. [2024-11-19 15:05:15,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 504 [2024-11-19 15:05:15,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2024-11-19 15:05:15,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 558 states and 925 transitions. [2024-11-19 15:05:15,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:15,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 558 states and 925 transitions. [2024-11-19 15:05:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states and 925 transitions. [2024-11-19 15:05:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 557. [2024-11-19 15:05:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 557 states have (on average 1.658886894075404) internal successors, (924), 556 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 924 transitions. [2024-11-19 15:05:15,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 557 states and 924 transitions. [2024-11-19 15:05:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:15,946 INFO L87 Difference]: Start difference. First operand 557 states and 924 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:16,023 INFO L93 Difference]: Finished difference Result 467 states and 747 transitions. [2024-11-19 15:05:16,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 467 states and 747 transitions. [2024-11-19 15:05:16,028 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 380 [2024-11-19 15:05:16,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 467 states to 434 states and 714 transitions. [2024-11-19 15:05:16,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2024-11-19 15:05:16,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2024-11-19 15:05:16,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 714 transitions. [2024-11-19 15:05:16,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:16,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 714 transitions. [2024-11-19 15:05:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 714 transitions. [2024-11-19 15:05:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 428. [2024-11-19 15:05:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 428 states have (on average 1.6542056074766356) internal successors, (708), 427 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 708 transitions. [2024-11-19 15:05:16,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 428 states and 708 transitions. [2024-11-19 15:05:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:16,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 428 states and 708 transitions. [2024-11-19 15:05:16,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 15:05:16,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 708 transitions. [2024-11-19 15:05:16,054 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 380 [2024-11-19 15:05:16,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:16,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:16,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:16,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:16,055 INFO L745 eck$LassoCheckResult]: Stem: 2923#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 2924#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 3085#L71-2 assume !(add_history_type_~var~0#1 < 3); 2978#L71-3 add_history_type_#res#1 := 1; 2777#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 2778#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 3093#L71-6 [2024-11-19 15:05:16,055 INFO L747 eck$LassoCheckResult]: Loop: 3093#L71-6 assume !!(add_history_type_~var~0#1 < 3); 3105#L72-2 assume !(0 == add_history_type_~history_id#1); 2933#L78-2 assume !(1 == add_history_type_~history_id#1); 2731#L84-2 assume !(2 == add_history_type_~history_id#1); 2733#L90-3 assume !(3 == add_history_type_~history_id#1); 2995#L90-5 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 3093#L71-6 [2024-11-19 15:05:16,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 889876098, now seen corresponding path program 1 times [2024-11-19 15:05:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868465869] [2024-11-19 15:05:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:16,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868465869] [2024-11-19 15:05:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868465869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855065760] [2024-11-19 15:05:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:16,144 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:16,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash 500074283, now seen corresponding path program 1 times [2024-11-19 15:05:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518196877] [2024-11-19 15:05:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:16,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:16,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:16,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:16,222 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:16,223 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:16,223 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:16,223 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:16,223 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:05:16,223 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,223 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:16,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:16,223 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2024-11-19 15:05:16,223 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:16,223 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:16,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:16,331 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:05:16,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:16,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 15:05:16,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:16,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:16,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 15:05:16,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:16,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 15:05:16,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:05:16,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:16,410 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:05:16,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 15:05:16,417 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:16,417 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:16,418 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:16,418 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:16,418 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:05:16,418 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,418 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:16,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:16,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2024-11-19 15:05:16,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:16,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:16,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:16,530 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:16,530 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:05:16,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:16,532 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:16,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 15:05:16,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:16,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:16,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:16,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:16,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:16,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:16,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:16,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:16,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:05:16,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:05:16,555 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:05:16,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:16,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:16,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 15:05:16,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:05:16,561 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:05:16,561 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:05:16,561 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 5 Supporting invariants [] [2024-11-19 15:05:16,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 15:05:16,578 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:05:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:16,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:05:16,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:16,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:05:16,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:16,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 15:05:16,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 428 states and 708 transitions. cyclomatic complexity: 288 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 428 states and 708 transitions. cyclomatic complexity: 288. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Result 702 states and 1155 transitions. Complement of second has 5 states. [2024-11-19 15:05:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:05:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2024-11-19 15:05:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 475 transitions. Stem has 6 letters. Loop has 6 letters. [2024-11-19 15:05:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 475 transitions. Stem has 12 letters. Loop has 6 letters. [2024-11-19 15:05:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 475 transitions. Stem has 6 letters. Loop has 12 letters. [2024-11-19 15:05:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:16,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 1155 transitions. [2024-11-19 15:05:16,742 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 540 [2024-11-19 15:05:16,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 699 states and 1146 transitions. [2024-11-19 15:05:16,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2024-11-19 15:05:16,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 628 [2024-11-19 15:05:16,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1146 transitions. [2024-11-19 15:05:16,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:16,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 699 states and 1146 transitions. [2024-11-19 15:05:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1146 transitions. [2024-11-19 15:05:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 480. [2024-11-19 15:05:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 480 states have (on average 1.6520833333333333) internal successors, (793), 479 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 793 transitions. [2024-11-19 15:05:16,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 480 states and 793 transitions. [2024-11-19 15:05:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:16,768 INFO L87 Difference]: Start difference. First operand 480 states and 793 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2024-11-19 15:05:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:16,814 INFO L93 Difference]: Finished difference Result 721 states and 1193 transitions. [2024-11-19 15:05:16,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1193 transitions. [2024-11-19 15:05:16,819 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2024-11-19 15:05:16,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1193 transitions. [2024-11-19 15:05:16,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2024-11-19 15:05:16,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2024-11-19 15:05:16,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1193 transitions. [2024-11-19 15:05:16,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:16,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 721 states and 1193 transitions. [2024-11-19 15:05:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1193 transitions. [2024-11-19 15:05:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 482. [2024-11-19 15:05:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.6452282157676348) internal successors, (793), 481 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 793 transitions. [2024-11-19 15:05:16,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 793 transitions. [2024-11-19 15:05:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:16,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 793 transitions. [2024-11-19 15:05:16,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 15:05:16,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 793 transitions. [2024-11-19 15:05:16,836 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2024-11-19 15:05:16,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:16,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:16,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:16,838 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] [2024-11-19 15:05:16,838 INFO L745 eck$LassoCheckResult]: Stem: 5341#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 5342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 5523#L71-2 assume !!(add_history_type_~var~0#1 < 3); 5480#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 5375#L126 assume 0 == read_history_bool_~history_id#1; 5376#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 5176#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 5536#L74 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 5173#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 5174#L210 assume 0 == init_~tmp~1#1;init_#res#1 := 0; 5236#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 5238#L500 assume !(0 == main_~i2~0#1); 5424#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 5387#L508-2 [2024-11-19 15:05:16,839 INFO L747 eck$LassoCheckResult]: Loop: 5387#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 5388#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 5210#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 5211#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 5337#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 5153#L181-2 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 5154#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 5492#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 5526#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 5498#L181-4 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 5162#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 5103#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 5104#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 5111#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 5112#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 5240#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 5222#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 5464#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 5441#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 5360#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 5522#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 5400#L126-12 assume 0 == read_history_bool_~history_id#1; 5393#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 5109#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 5365#L262 assume !(0 == check_~tmp___3~0#1 % 256); 5220#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 5458#L106-7 assume 3 == read_history_int8_~history_id#1; 5463#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 5095#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 5096#L301 assume !(check_~tmp___10~0#1 > -2); 5428#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 5504#L106-9 assume 3 == read_history_int8_~history_id#1; 5534#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 5293#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 5371#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 5075#L321-1 check_#res#1 := 1; 5219#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 5330#L533-72 assume !(0 == assert_~arg#1 % 256); 5406#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 5387#L508-2 [2024-11-19 15:05:16,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 417201271, now seen corresponding path program 1 times [2024-11-19 15:05:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890317840] [2024-11-19 15:05:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890317840] [2024-11-19 15:05:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890317840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:05:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007315255] [2024-11-19 15:05:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:16,899 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:16,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1563585492, now seen corresponding path program 1 times [2024-11-19 15:05:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026867912] [2024-11-19 15:05:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026867912] [2024-11-19 15:05:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026867912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396129351] [2024-11-19 15:05:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:16,976 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:05:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:05:16,977 INFO L87 Difference]: Start difference. First operand 482 states and 793 transitions. cyclomatic complexity: 319 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:17,041 INFO L93 Difference]: Finished difference Result 699 states and 1143 transitions. [2024-11-19 15:05:17,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 699 states and 1143 transitions. [2024-11-19 15:05:17,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 15:05:17,050 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2024-11-19 15:05:17,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 699 states to 697 states and 1138 transitions. [2024-11-19 15:05:17,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2024-11-19 15:05:17,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2024-11-19 15:05:17,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 697 states and 1138 transitions. [2024-11-19 15:05:17,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:17,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 697 states and 1138 transitions. [2024-11-19 15:05:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states and 1138 transitions. [2024-11-19 15:05:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 482. [2024-11-19 15:05:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.6369294605809128) internal successors, (789), 481 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 789 transitions. [2024-11-19 15:05:17,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 789 transitions. [2024-11-19 15:05:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 15:05:17,070 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 789 transitions. [2024-11-19 15:05:17,070 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 15:05:17,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 789 transitions. [2024-11-19 15:05:17,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2024-11-19 15:05:17,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:17,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:17,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:17,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:17,075 INFO L745 eck$LassoCheckResult]: Stem: 6530#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 6531#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 6711#L71-2 assume !!(add_history_type_~var~0#1 < 3); 6669#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 6564#L126 assume 0 == read_history_bool_~history_id#1; 6565#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 6365#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 6724#L74 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 6362#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 6363#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 6624#L71-6 assume !!(add_history_type_~var~0#1 < 3); 6626#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 6719#L126-3 assume 0 == read_history_bool_~history_id#1; 6712#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 6370#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 6694#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 6275#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 6459#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 6617#L71-10 assume !!(add_history_type_~var~0#1 < 3); 6733#L72-4 [2024-11-19 15:05:17,075 INFO L747 eck$LassoCheckResult]: Loop: 6733#L72-4 assume !(0 == add_history_type_~history_id#1); 6327#L78-4 assume !(1 == add_history_type_~history_id#1); 6329#L84-4 assume !(2 == add_history_type_~history_id#1); 6555#L90-6 assume !(3 == add_history_type_~history_id#1); 6641#L90-8 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 6730#L71-10 assume !!(add_history_type_~var~0#1 < 3); 6733#L72-4 [2024-11-19 15:05:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -288136996, now seen corresponding path program 1 times [2024-11-19 15:05:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105007553] [2024-11-19 15:05:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105007553] [2024-11-19 15:05:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105007553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:05:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096858704] [2024-11-19 15:05:17,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:17,141 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1731815895, now seen corresponding path program 1 times [2024-11-19 15:05:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353254162] [2024-11-19 15:05:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:17,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:17,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:17,186 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:17,187 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:17,187 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:17,187 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:17,187 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:05:17,187 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,187 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:17,187 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:17,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2024-11-19 15:05:17,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:17,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:17,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,284 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:17,284 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:05:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,286 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 15:05:17,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:17,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:17,309 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:05:17,309 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:05:17,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 15:05:17,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 15:05:17,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:17,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:17,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:17,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 15:05:17,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:05:17,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:17,457 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:05:17,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:17,465 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:17,465 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:17,465 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:17,465 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:17,465 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:05:17,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:17,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:17,466 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2024-11-19 15:05:17,466 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:17,466 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:17,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:17,566 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:17,567 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:05:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,569 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 15:05:17,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:17,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:17,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:17,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:17,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:17,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:17,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:17,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:17,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:05:17,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:17,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,603 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 15:05:17,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:17,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:17,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:17,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:17,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:17,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:17,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:17,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:17,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:05:17,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:05:17,627 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:05:17,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:17,629 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:17,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 15:05:17,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:05:17,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:05:17,632 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:05:17,632 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 3 Supporting invariants [] [2024-11-19 15:05:17,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 15:05:17,648 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:05:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:17,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:05:17,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:17,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:05:17,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:17,786 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 15:05:17,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 482 states and 789 transitions. cyclomatic complexity: 315 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,821 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 482 states and 789 transitions. cyclomatic complexity: 315. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Result 538 states and 885 transitions. Complement of second has 7 states. [2024-11-19 15:05:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 15:05:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-19 15:05:17,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 19 letters. Loop has 6 letters. [2024-11-19 15:05:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:17,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 25 letters. Loop has 6 letters. [2024-11-19 15:05:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:17,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 19 letters. Loop has 12 letters. [2024-11-19 15:05:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:17,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 885 transitions. [2024-11-19 15:05:17,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2024-11-19 15:05:17,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 537 states and 881 transitions. [2024-11-19 15:05:17,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2024-11-19 15:05:17,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 411 [2024-11-19 15:05:17,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 537 states and 881 transitions. [2024-11-19 15:05:17,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:17,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 537 states and 881 transitions. [2024-11-19 15:05:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states and 881 transitions. [2024-11-19 15:05:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2024-11-19 15:05:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 534 states have (on average 1.6441947565543071) internal successors, (878), 533 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 878 transitions. [2024-11-19 15:05:17,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 534 states and 878 transitions. [2024-11-19 15:05:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:05:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:05:17,840 INFO L87 Difference]: Start difference. First operand 534 states and 878 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:17,886 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-11-19 15:05:17,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 882 transitions. [2024-11-19 15:05:17,889 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2024-11-19 15:05:17,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 523 states and 856 transitions. [2024-11-19 15:05:17,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2024-11-19 15:05:17,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2024-11-19 15:05:17,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 856 transitions. [2024-11-19 15:05:17,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:17,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 523 states and 856 transitions. [2024-11-19 15:05:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 856 transitions. [2024-11-19 15:05:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 520. [2024-11-19 15:05:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 520 states have (on average 1.6403846153846153) internal successors, (853), 519 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2024-11-19 15:05:17,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 520 states and 853 transitions. [2024-11-19 15:05:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 15:05:17,901 INFO L425 stractBuchiCegarLoop]: Abstraction has 520 states and 853 transitions. [2024-11-19 15:05:17,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 15:05:17,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 853 transitions. [2024-11-19 15:05:17,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2024-11-19 15:05:17,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:17,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:17,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem 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] [2024-11-19 15:05:17,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:05:17,905 INFO L745 eck$LassoCheckResult]: Stem: 8745#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 8746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 8938#L71-2 assume !!(add_history_type_~var~0#1 < 3); 8895#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 8786#L126 assume 0 == read_history_bool_~history_id#1; 8787#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 8575#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 8952#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 8747#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 8748#L71-2 assume !(add_history_type_~var~0#1 < 3); 8809#L71-3 add_history_type_#res#1 := 1; 8571#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 8572#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 8849#L71-6 assume !!(add_history_type_~var~0#1 < 3); 8851#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 8947#L126-3 assume 0 == read_history_bool_~history_id#1; 8939#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 8577#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 8918#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 8466#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 8668#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 8800#L71-10 assume !!(add_history_type_~var~0#1 < 3); 8687#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 8541#L126-6 assume 0 == read_history_bool_~history_id#1; 8542#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 8514#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 8925#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 8470#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 8471#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 8755#L71-14 assume !!(add_history_type_~var~0#1 < 3); 8961#L72-6 [2024-11-19 15:05:17,906 INFO L747 eck$LassoCheckResult]: Loop: 8961#L72-6 assume !(0 == add_history_type_~history_id#1); 8936#L78-6 assume !(1 == add_history_type_~history_id#1); 8874#L84-6 assume !(2 == add_history_type_~history_id#1); 8876#L90-9 assume !(3 == add_history_type_~history_id#1); 8767#L90-11 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 8888#L71-14 assume !!(add_history_type_~var~0#1 < 3); 8961#L72-6 [2024-11-19 15:05:17,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash -446471529, now seen corresponding path program 1 times [2024-11-19 15:05:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217649667] [2024-11-19 15:05:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217649667] [2024-11-19 15:05:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217649667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:05:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652115508] [2024-11-19 15:05:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:05:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,002 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 15:05:18,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 15:05:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:18,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 15:05:18,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:18,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:05:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652115508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:05:18,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:05:18,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 15:05:18,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828174122] [2024-11-19 15:05:18,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:05:18,193 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:18,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 951913687, now seen corresponding path program 1 times [2024-11-19 15:05:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:18,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609806381] [2024-11-19 15:05:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:18,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:18,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:18,242 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:18,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:18,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:18,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:18,243 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:05:18,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:18,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:18,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2024-11-19 15:05:18,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:18,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:18,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,332 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:18,332 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:05:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 15:05:18,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:18,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:18,356 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:05:18,356 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Honda state: {ULTIMATE.start_add_history_type_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:05:18,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:18,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,375 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 15:05:18,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:18,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:18,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 15:05:18,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,408 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 15:05:18,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:05:18,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:18,495 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:05:18,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:18,502 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:18,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:18,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:18,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:18,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:05:18,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:18,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:18,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2024-11-19 15:05:18,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:18,502 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:18,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:18,595 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:18,596 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:05:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,598 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 15:05:18,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:18,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:18,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:18,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:18,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:18,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:18,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:18,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:18,615 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:05:18,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:05:18,617 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:05:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:18,619 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:18,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 15:05:18,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:05:18,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:05:18,621 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:05:18,622 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0#1) = -2*ULTIMATE.start_add_history_type_~var~0#1 + 3 Supporting invariants [] [2024-11-19 15:05:18,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-19 15:05:18,637 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:05:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:18,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:05:18,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:18,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:05:18,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:18,757 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 15:05:18,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 520 states and 853 transitions. cyclomatic complexity: 341 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2024-11-19 15:05:18,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 520 states and 853 transitions. cyclomatic complexity: 341. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) Result 576 states and 949 transitions. Complement of second has 7 states. [2024-11-19 15:05:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 15:05:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2024-11-19 15:05:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-11-19 15:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 30 letters. Loop has 6 letters. [2024-11-19 15:05:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 36 letters. Loop has 6 letters. [2024-11-19 15:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 30 letters. Loop has 12 letters. [2024-11-19 15:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:18,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 949 transitions. [2024-11-19 15:05:18,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2024-11-19 15:05:18,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 575 states and 945 transitions. [2024-11-19 15:05:18,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 392 [2024-11-19 15:05:18,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 394 [2024-11-19 15:05:18,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 945 transitions. [2024-11-19 15:05:18,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:18,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 575 states and 945 transitions. [2024-11-19 15:05:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 945 transitions. [2024-11-19 15:05:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 572. [2024-11-19 15:05:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 572 states have (on average 1.6468531468531469) internal successors, (942), 571 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 942 transitions. [2024-11-19 15:05:18,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 572 states and 942 transitions. [2024-11-19 15:05:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:05:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:05:18,805 INFO L87 Difference]: Start difference. First operand 572 states and 942 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:18,895 INFO L93 Difference]: Finished difference Result 1243 states and 2053 transitions. [2024-11-19 15:05:18,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1243 states and 2053 transitions. [2024-11-19 15:05:18,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2024-11-19 15:05:18,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1243 states to 1235 states and 2029 transitions. [2024-11-19 15:05:18,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 697 [2024-11-19 15:05:18,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 697 [2024-11-19 15:05:18,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1235 states and 2029 transitions. [2024-11-19 15:05:18,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:18,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1235 states and 2029 transitions. [2024-11-19 15:05:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states and 2029 transitions. [2024-11-19 15:05:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 921. [2024-11-19 15:05:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 921 states have (on average 1.6492942453854507) internal successors, (1519), 920 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1519 transitions. [2024-11-19 15:05:18,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 921 states and 1519 transitions. [2024-11-19 15:05:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 15:05:18,929 INFO L425 stractBuchiCegarLoop]: Abstraction has 921 states and 1519 transitions. [2024-11-19 15:05:18,929 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 15:05:18,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 921 states and 1519 transitions. [2024-11-19 15:05:18,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2024-11-19 15:05:18,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:18,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:18,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:18,935 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] [2024-11-19 15:05:18,936 INFO L745 eck$LassoCheckResult]: Stem: 11990#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 11991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 12214#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12165#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 12037#L126 assume 0 == read_history_bool_~history_id#1; 12038#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 11800#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12232#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 11992#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 11993#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12215#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 12328#L126 assume 0 == read_history_bool_~history_id#1; 12322#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 12317#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12316#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 12315#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 12314#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12299#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 12313#L126 assume 0 == read_history_bool_~history_id#1; 12307#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 12302#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12301#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 12300#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 12298#L71-2 assume !(add_history_type_~var~0#1 < 3); 12060#L71-3 add_history_type_#res#1 := 1; 11797#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 11798#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 12105#L71-6 assume !!(add_history_type_~var~0#1 < 3); 12106#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 12226#L126-3 assume 0 == read_history_bool_~history_id#1; 12216#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 11803#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12191#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 11687#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 11903#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 12096#L71-10 assume !!(add_history_type_~var~0#1 < 3); 11922#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 11765#L126-6 assume 0 == read_history_bool_~history_id#1; 11766#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 11737#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12199#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 11688#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 11689#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 12002#L71-14 assume !!(add_history_type_~var~0#1 < 3); 12120#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 11948#L126-9 assume 0 == read_history_bool_~history_id#1; 11950#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 12045#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 12046#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 11819#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 11862#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 11863#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 11867#L500 assume !(0 == main_~i2~0#1); 12090#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 12049#L508-2 [2024-11-19 15:05:18,937 INFO L747 eck$LassoCheckResult]: Loop: 12049#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 12050#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 11840#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 11841#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 11984#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 11773#L181-2 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 11774#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 12177#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 12218#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 12183#L181-4 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 11782#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 11704#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 11705#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 11714#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 11715#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 11868#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 11846#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 12143#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 12111#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 12017#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 12213#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 12061#L126-12 assume 0 == read_history_bool_~history_id#1; 12055#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 11712#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 12023#L262 assume !(0 == check_~tmp___3~0#1 % 256); 11844#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 12134#L106-7 assume 3 == read_history_int8_~history_id#1; 12142#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 11696#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 11697#L301 assume !(check_~tmp___10~0#1 > -2); 12095#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 12190#L106-9 assume 3 == read_history_int8_~history_id#1; 12230#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 11930#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 12032#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 11676#L321-1 check_#res#1 := 1; 11843#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 11974#L533-72 assume !(0 == assert_~arg#1 % 256); 12068#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 12049#L508-2 [2024-11-19 15:05:18,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 1 times [2024-11-19 15:05:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:18,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818272962] [2024-11-19 15:05:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:19,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:19,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818272962] [2024-11-19 15:05:19,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818272962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750454315] [2024-11-19 15:05:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,093 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1563585492, now seen corresponding path program 2 times [2024-11-19 15:05:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329048399] [2024-11-19 15:05:19,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:05:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,115 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:05:19,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329048399] [2024-11-19 15:05:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329048399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317758134] [2024-11-19 15:05:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,165 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:19,166 INFO L87 Difference]: Start difference. First operand 921 states and 1519 transitions. cyclomatic complexity: 606 Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2024-11-19 15:05:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:19,213 INFO L93 Difference]: Finished difference Result 921 states and 1517 transitions. [2024-11-19 15:05:19,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 921 states and 1517 transitions. [2024-11-19 15:05:19,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2024-11-19 15:05:19,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 921 states to 921 states and 1517 transitions. [2024-11-19 15:05:19,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 489 [2024-11-19 15:05:19,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 489 [2024-11-19 15:05:19,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 921 states and 1517 transitions. [2024-11-19 15:05:19,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:19,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 921 states and 1517 transitions. [2024-11-19 15:05:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states and 1517 transitions. [2024-11-19 15:05:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-19 15:05:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 921 states have (on average 1.6471226927252987) internal successors, (1517), 920 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1517 transitions. [2024-11-19 15:05:19,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 921 states and 1517 transitions. [2024-11-19 15:05:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:19,242 INFO L425 stractBuchiCegarLoop]: Abstraction has 921 states and 1517 transitions. [2024-11-19 15:05:19,242 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 15:05:19,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 921 states and 1517 transitions. [2024-11-19 15:05:19,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2024-11-19 15:05:19,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:19,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:19,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:19,254 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] [2024-11-19 15:05:19,254 INFO L745 eck$LassoCheckResult]: Stem: 13840#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 13841#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 14064#L71-2 assume !!(add_history_type_~var~0#1 < 3); 14014#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 13885#L126 assume 0 == read_history_bool_~history_id#1; 13886#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13650#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 14081#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 13842#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 13843#L71-2 assume !!(add_history_type_~var~0#1 < 3); 14065#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 14347#L126 assume 0 == read_history_bool_~history_id#1; 14343#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 14338#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 14337#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 14336#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 14335#L71-2 assume !!(add_history_type_~var~0#1 < 3); 14320#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 14332#L126 assume 0 == read_history_bool_~history_id#1; 14328#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 14323#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 14322#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 14321#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 14319#L71-2 assume !(add_history_type_~var~0#1 < 3); 13908#L71-3 add_history_type_#res#1 := 1; 13647#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 13648#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 13954#L71-6 assume !!(add_history_type_~var~0#1 < 3); 13955#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 14076#L126-3 assume 0 == read_history_bool_~history_id#1; 14066#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13653#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 14040#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 13538#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 13753#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 13945#L71-10 assume !!(add_history_type_~var~0#1 < 3); 13772#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 13616#L126-6 assume 0 == read_history_bool_~history_id#1; 13617#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13588#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 14048#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 13539#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 13540#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 13852#L71-14 assume !!(add_history_type_~var~0#1 < 3); 13969#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 13799#L126-9 assume 0 == read_history_bool_~history_id#1; 13801#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13893#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 13894#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 13669#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 13712#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 13713#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 13717#L500 assume !(0 == main_~i2~0#1); 13939#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 13897#L508-2 [2024-11-19 15:05:19,255 INFO L747 eck$LassoCheckResult]: Loop: 13897#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 13898#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 13690#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 13691#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 13834#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 13624#L181-2 assume !(0 == write_history_bool_~history_id#1); 13625#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 13797#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 14027#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 14068#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 14033#L181-4 assume !(0 == write_history_bool_~history_id#1); 13818#L186-4 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 13632#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 13555#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 13556#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 13565#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 13566#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 13718#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 13696#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 13993#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 13959#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 13866#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 14063#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 13909#L126-12 assume 0 == read_history_bool_~history_id#1; 13903#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13563#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 13872#L262 assume !(0 == check_~tmp___3~0#1 % 256); 13694#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 13983#L106-7 assume 3 == read_history_int8_~history_id#1; 13992#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 13547#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 13548#L301 assume !(check_~tmp___10~0#1 > -2); 13944#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 14039#L106-9 assume 3 == read_history_int8_~history_id#1; 14079#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 13780#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 13880#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 13527#L321-1 check_#res#1 := 1; 13693#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 13825#L533-72 assume !(0 == assert_~arg#1 % 256); 13916#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 13897#L508-2 [2024-11-19 15:05:19,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 2 times [2024-11-19 15:05:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537765997] [2024-11-19 15:05:19,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:05:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:05:19,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537765997] [2024-11-19 15:05:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537765997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126631924] [2024-11-19 15:05:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,335 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1653383515, now seen corresponding path program 1 times [2024-11-19 15:05:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970312180] [2024-11-19 15:05:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970312180] [2024-11-19 15:05:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970312180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638558054] [2024-11-19 15:05:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,396 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:19,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:19,396 INFO L87 Difference]: Start difference. First operand 921 states and 1517 transitions. cyclomatic complexity: 604 Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:19,425 INFO L93 Difference]: Finished difference Result 919 states and 1513 transitions. [2024-11-19 15:05:19,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 919 states and 1513 transitions. [2024-11-19 15:05:19,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2024-11-19 15:05:19,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 919 states to 919 states and 1513 transitions. [2024-11-19 15:05:19,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 487 [2024-11-19 15:05:19,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 487 [2024-11-19 15:05:19,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 919 states and 1513 transitions. [2024-11-19 15:05:19,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:19,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 919 states and 1513 transitions. [2024-11-19 15:05:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states and 1513 transitions. [2024-11-19 15:05:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2024-11-19 15:05:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 919 states have (on average 1.646354733405876) internal successors, (1513), 918 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1513 transitions. [2024-11-19 15:05:19,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 919 states and 1513 transitions. [2024-11-19 15:05:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:19,446 INFO L425 stractBuchiCegarLoop]: Abstraction has 919 states and 1513 transitions. [2024-11-19 15:05:19,446 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 15:05:19,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 919 states and 1513 transitions. [2024-11-19 15:05:19,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 213 [2024-11-19 15:05:19,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:19,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:19,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:19,451 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] [2024-11-19 15:05:19,451 INFO L745 eck$LassoCheckResult]: Stem: 15689#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 15690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 15912#L71-2 assume !!(add_history_type_~var~0#1 < 3); 15862#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 15736#L126 assume 0 == read_history_bool_~history_id#1; 15737#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15499#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 15930#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 15691#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 15692#L71-2 assume !!(add_history_type_~var~0#1 < 3); 15913#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 16160#L126 assume 0 == read_history_bool_~history_id#1; 16154#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 16149#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 16148#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 16147#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 16146#L71-2 assume !!(add_history_type_~var~0#1 < 3); 16131#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 16145#L126 assume 0 == read_history_bool_~history_id#1; 16139#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 16134#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 16133#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 16132#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 16130#L71-2 assume !(add_history_type_~var~0#1 < 3); 15758#L71-3 add_history_type_#res#1 := 1; 15496#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 15497#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 15804#L71-6 assume !!(add_history_type_~var~0#1 < 3); 15805#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 15925#L126-3 assume 0 == read_history_bool_~history_id#1; 15914#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15502#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 15887#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 15387#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 15602#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 15795#L71-10 assume !!(add_history_type_~var~0#1 < 3); 15621#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 15465#L126-6 assume 0 == read_history_bool_~history_id#1; 15466#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15437#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 15895#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 15388#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 15389#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 15701#L71-14 assume !!(add_history_type_~var~0#1 < 3); 15819#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 15648#L126-9 assume 0 == read_history_bool_~history_id#1; 15650#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15743#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 15744#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 15518#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 15561#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 15562#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 15566#L500 assume !(0 == main_~i2~0#1); 15789#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 15747#L508-2 [2024-11-19 15:05:19,452 INFO L747 eck$LassoCheckResult]: Loop: 15747#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 15748#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 15539#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 15540#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 15683#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 15473#L181-2 assume !(0 == write_history_bool_~history_id#1); 15474#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 15646#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 15874#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 15916#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 15880#L181-4 assume !(0 == write_history_bool_~history_id#1); 15667#L186-4 assume !(1 == write_history_bool_~history_id#1); 15668#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 15481#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 15404#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 15405#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 15414#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 15415#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 15567#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 15545#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 15842#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 15810#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 15715#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 15911#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 15759#L126-12 assume 0 == read_history_bool_~history_id#1; 15753#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15412#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 15721#L262 assume !(0 == check_~tmp___3~0#1 % 256); 15543#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 15833#L106-7 assume 3 == read_history_int8_~history_id#1; 15841#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 15396#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 15397#L301 assume !(check_~tmp___10~0#1 > -2); 15794#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 15886#L106-9 assume 3 == read_history_int8_~history_id#1; 15928#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 15629#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 15731#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 15376#L321-1 check_#res#1 := 1; 15542#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 15674#L533-72 assume !(0 == assert_~arg#1 % 256); 15766#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 15747#L508-2 [2024-11-19 15:05:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 3 times [2024-11-19 15:05:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578782603] [2024-11-19 15:05:19,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:05:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,471 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:05:19,472 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578782603] [2024-11-19 15:05:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578782603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291715247] [2024-11-19 15:05:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,534 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -283088530, now seen corresponding path program 1 times [2024-11-19 15:05:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984167087] [2024-11-19 15:05:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984167087] [2024-11-19 15:05:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984167087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092948373] [2024-11-19 15:05:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,648 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:19,649 INFO L87 Difference]: Start difference. First operand 919 states and 1513 transitions. cyclomatic complexity: 602 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2024-11-19 15:05:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:19,677 INFO L93 Difference]: Finished difference Result 1118 states and 1832 transitions. [2024-11-19 15:05:19,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1118 states and 1832 transitions. [2024-11-19 15:05:19,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 412 [2024-11-19 15:05:19,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1118 states to 1118 states and 1832 transitions. [2024-11-19 15:05:19,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 686 [2024-11-19 15:05:19,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 686 [2024-11-19 15:05:19,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1118 states and 1832 transitions. [2024-11-19 15:05:19,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:19,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1118 states and 1832 transitions. [2024-11-19 15:05:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states and 1832 transitions. [2024-11-19 15:05:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 961. [2024-11-19 15:05:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 961 states have (on average 1.6378772112382936) internal successors, (1574), 960 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1574 transitions. [2024-11-19 15:05:19,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 961 states and 1574 transitions. [2024-11-19 15:05:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:19,706 INFO L425 stractBuchiCegarLoop]: Abstraction has 961 states and 1574 transitions. [2024-11-19 15:05:19,706 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 15:05:19,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 961 states and 1574 transitions. [2024-11-19 15:05:19,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2024-11-19 15:05:19,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:19,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:19,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:19,712 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] [2024-11-19 15:05:19,713 INFO L745 eck$LassoCheckResult]: Stem: 17739#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 17740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 17964#L71-2 assume !!(add_history_type_~var~0#1 < 3); 17909#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 17784#L126 assume 0 == read_history_bool_~history_id#1; 17785#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17546#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 17979#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 17741#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 17742#L71-2 assume !!(add_history_type_~var~0#1 < 3); 17965#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 18219#L126 assume 0 == read_history_bool_~history_id#1; 18204#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 18194#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 18193#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 18192#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 18191#L71-2 assume !!(add_history_type_~var~0#1 < 3); 18176#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 18189#L126 assume 0 == read_history_bool_~history_id#1; 18184#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 18179#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 18178#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 18177#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 18175#L71-2 assume !(add_history_type_~var~0#1 < 3); 17808#L71-3 add_history_type_#res#1 := 1; 17542#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 17543#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 17851#L71-6 assume !!(add_history_type_~var~0#1 < 3); 17852#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 17974#L126-3 assume 0 == read_history_bool_~history_id#1; 17962#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17548#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 17936#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 17433#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 17652#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 17842#L71-10 assume !!(add_history_type_~var~0#1 < 3); 17671#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 17511#L126-6 assume 0 == read_history_bool_~history_id#1; 17512#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17483#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 17947#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 17434#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 17435#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 17751#L71-14 assume !!(add_history_type_~var~0#1 < 3); 17866#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 17698#L126-9 assume 0 == read_history_bool_~history_id#1; 17700#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17791#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 17792#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 17564#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 17607#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 17608#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 17614#L500 assume !(0 == main_~i2~0#1); 17836#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 17795#L508-2 [2024-11-19 15:05:19,713 INFO L747 eck$LassoCheckResult]: Loop: 17795#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 17796#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 17585#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 17586#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 17939#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 17519#L181-2 assume !(0 == write_history_bool_~history_id#1); 17520#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 17696#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 17921#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 17966#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 17927#L181-4 assume !(0 == write_history_bool_~history_id#1); 17717#L186-4 assume !(1 == write_history_bool_~history_id#1); 17718#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 17527#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 17450#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 17451#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 17460#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 17461#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 17934#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 17591#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 17889#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 17857#L249 assume !(0 == ~gate1Failed~0 % 256); 17764#L252 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; 17765#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 17961#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 17806#L126-12 assume 0 == read_history_bool_~history_id#1; 17801#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17458#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 17771#L262 assume !(0 == check_~tmp___3~0#1 % 256); 17589#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 17880#L106-7 assume 3 == read_history_int8_~history_id#1; 17888#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 17442#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 17443#L301 assume !(check_~tmp___10~0#1 > -2); 17841#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 17935#L106-9 assume 3 == read_history_int8_~history_id#1; 17977#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 17679#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 17779#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 17422#L321-1 check_#res#1 := 1; 17588#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 17724#L533-72 assume !(0 == assert_~arg#1 % 256); 17814#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 17795#L508-2 [2024-11-19 15:05:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 4 times [2024-11-19 15:05:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182681008] [2024-11-19 15:05:19,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:05:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,737 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:05:19,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182681008] [2024-11-19 15:05:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182681008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:19,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793140609] [2024-11-19 15:05:19,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,766 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:19,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1657266783, now seen corresponding path program 1 times [2024-11-19 15:05:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538294454] [2024-11-19 15:05:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:19,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538294454] [2024-11-19 15:05:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538294454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490345736] [2024-11-19 15:05:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,811 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:19,812 INFO L87 Difference]: Start difference. First operand 961 states and 1574 transitions. cyclomatic complexity: 621 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) [2024-11-19 15:05:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:19,837 INFO L93 Difference]: Finished difference Result 1191 states and 1939 transitions. [2024-11-19 15:05:19,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1191 states and 1939 transitions. [2024-11-19 15:05:19,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 485 [2024-11-19 15:05:19,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1191 states to 1191 states and 1939 transitions. [2024-11-19 15:05:19,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 759 [2024-11-19 15:05:19,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 759 [2024-11-19 15:05:19,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1939 transitions. [2024-11-19 15:05:19,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:19,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1191 states and 1939 transitions. [2024-11-19 15:05:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1939 transitions. [2024-11-19 15:05:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1020. [2024-11-19 15:05:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1020 states have (on average 1.6274509803921569) internal successors, (1660), 1019 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1660 transitions. [2024-11-19 15:05:19,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1660 transitions. [2024-11-19 15:05:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:19,864 INFO L425 stractBuchiCegarLoop]: Abstraction has 1020 states and 1660 transitions. [2024-11-19 15:05:19,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 15:05:19,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1020 states and 1660 transitions. [2024-11-19 15:05:19,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 314 [2024-11-19 15:05:19,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:19,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:19,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:19,869 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] [2024-11-19 15:05:19,869 INFO L745 eck$LassoCheckResult]: Stem: 19896#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 19897#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 20123#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20068#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 19940#L126 assume 0 == read_history_bool_~history_id#1; 19941#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19706#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 20141#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 19898#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 19899#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20124#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 20389#L126 assume 0 == read_history_bool_~history_id#1; 20289#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 20284#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 20283#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 20281#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 20280#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20257#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 20276#L126 assume 0 == read_history_bool_~history_id#1; 20265#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 20260#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 20259#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 20258#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 20256#L71-2 assume !(add_history_type_~var~0#1 < 3); 19964#L71-3 add_history_type_#res#1 := 1; 19702#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 19703#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 20007#L71-6 assume !!(add_history_type_~var~0#1 < 3); 20008#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 20133#L126-3 assume 0 == read_history_bool_~history_id#1; 20121#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19708#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 20096#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 19592#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 19809#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 19998#L71-10 assume !!(add_history_type_~var~0#1 < 3); 19828#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 19670#L126-6 assume 0 == read_history_bool_~history_id#1; 19671#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19642#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 20104#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 19593#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 19594#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 19908#L71-14 assume !!(add_history_type_~var~0#1 < 3); 20023#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 19855#L126-9 assume 0 == read_history_bool_~history_id#1; 19857#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19947#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 19948#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 19724#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 19768#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 19769#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 19773#L500 assume !(0 == main_~i2~0#1); 19992#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 19951#L508-2 [2024-11-19 15:05:19,869 INFO L747 eck$LassoCheckResult]: Loop: 19951#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 19952#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 19745#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 19746#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 20116#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 20459#L181-2 assume !(0 == write_history_bool_~history_id#1); 20455#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 20454#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 20453#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 20452#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 20451#L181-4 assume !(0 == write_history_bool_~history_id#1); 20450#L186-4 assume !(1 == write_history_bool_~history_id#1); 20447#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 20445#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 20443#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 20441#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 20434#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 20430#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 20428#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 20426#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 20425#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 20397#L249 assume !(0 == ~gate1Failed~0 % 256); 19921#L252 assume !(0 == ~gate2Failed~0 % 256); 19922#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 20027#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 20120#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 19962#L126-12 assume 0 == read_history_bool_~history_id#1; 19957#L127-12 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19617#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 19927#L262 assume !(0 == check_~tmp___3~0#1 % 256); 19749#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 20038#L106-7 assume 3 == read_history_int8_~history_id#1; 20047#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 19601#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 19602#L301 assume !(check_~tmp___10~0#1 > -2); 19997#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 20095#L106-9 assume 3 == read_history_int8_~history_id#1; 20139#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 19836#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 19935#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 19581#L321-1 check_#res#1 := 1; 19748#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 19881#L533-72 assume !(0 == assert_~arg#1 % 256); 19970#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 19951#L508-2 [2024-11-19 15:05:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 5 times [2024-11-19 15:05:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300296190] [2024-11-19 15:05:19,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:05:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:19,903 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 15:05:19,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:19,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300296190] [2024-11-19 15:05:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300296190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:19,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401319472] [2024-11-19 15:05:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:19,998 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1136771563, now seen corresponding path program 1 times [2024-11-19 15:05:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480991524] [2024-11-19 15:05:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480991524] [2024-11-19 15:05:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480991524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:20,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:20,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355953203] [2024-11-19 15:05:20,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:20,068 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:20,069 INFO L87 Difference]: Start difference. First operand 1020 states and 1660 transitions. cyclomatic complexity: 648 Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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) [2024-11-19 15:05:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:20,355 INFO L93 Difference]: Finished difference Result 1026 states and 1630 transitions. [2024-11-19 15:05:20,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1026 states and 1630 transitions. [2024-11-19 15:05:20,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2024-11-19 15:05:20,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1026 states to 1026 states and 1630 transitions. [2024-11-19 15:05:20,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2024-11-19 15:05:20,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2024-11-19 15:05:20,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1630 transitions. [2024-11-19 15:05:20,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:20,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1630 transitions. [2024-11-19 15:05:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1630 transitions. [2024-11-19 15:05:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1020. [2024-11-19 15:05:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1020 states have (on average 1.592156862745098) internal successors, (1624), 1019 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1624 transitions. [2024-11-19 15:05:20,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1624 transitions. [2024-11-19 15:05:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:20,385 INFO L425 stractBuchiCegarLoop]: Abstraction has 1020 states and 1624 transitions. [2024-11-19 15:05:20,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 15:05:20,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1020 states and 1624 transitions. [2024-11-19 15:05:20,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 314 [2024-11-19 15:05:20,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:20,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:20,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:20,392 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] [2024-11-19 15:05:20,392 INFO L745 eck$LassoCheckResult]: Stem: 21947#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 21948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 22172#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22121#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 21991#L126 assume 0 == read_history_bool_~history_id#1; 21992#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 21756#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22189#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 21949#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 21950#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22173#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 22537#L126 assume 0 == read_history_bool_~history_id#1; 22533#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 22528#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22527#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 22526#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 22524#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22509#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 22520#L126 assume 0 == read_history_bool_~history_id#1; 22517#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 22512#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22511#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 22510#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 22508#L71-2 assume !(add_history_type_~var~0#1 < 3); 22014#L71-3 add_history_type_#res#1 := 1; 21753#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 21754#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 22060#L71-6 assume !!(add_history_type_~var~0#1 < 3); 22061#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 22183#L126-3 assume 0 == read_history_bool_~history_id#1; 22174#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 21759#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22147#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 21645#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 21860#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 22050#L71-10 assume !!(add_history_type_~var~0#1 < 3); 21879#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 21723#L126-6 assume 0 == read_history_bool_~history_id#1; 21724#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 21694#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22156#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 21646#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 21647#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 21959#L71-14 assume !!(add_history_type_~var~0#1 < 3); 22075#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 21906#L126-9 assume 0 == read_history_bool_~history_id#1; 21908#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 21999#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 22000#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 21775#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 21818#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 21819#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 21823#L500 assume !(0 == main_~i2~0#1); 22044#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 22003#L508-2 [2024-11-19 15:05:20,394 INFO L747 eck$LassoCheckResult]: Loop: 22003#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 22004#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 21796#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 21797#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 22167#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 22463#L181-2 assume !(0 == write_history_bool_~history_id#1); 22457#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 22456#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 22455#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 22200#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 22140#L181-4 assume !(0 == write_history_bool_~history_id#1); 21925#L186-4 assume !(1 == write_history_bool_~history_id#1); 21926#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 21996#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 22476#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 22474#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 22467#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 22462#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 22415#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 22403#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 22401#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 22066#L249 assume !(0 == ~gate1Failed~0 % 256); 21972#L252 assume !(0 == ~gate2Failed~0 % 256); 21973#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 22079#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 22171#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 22015#L126-12 assume 0 == read_history_bool_~history_id#1; 22009#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 21985#L130-12 assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); 21704#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 21978#L262 assume !(0 == check_~tmp___3~0#1 % 256); 21800#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 22091#L106-7 assume 3 == read_history_int8_~history_id#1; 22099#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 21653#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 21654#L301 assume !(check_~tmp___10~0#1 > -2); 22049#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 22146#L106-9 assume 3 == read_history_int8_~history_id#1; 22187#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 21887#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 21986#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 21635#L321-1 check_#res#1 := 1; 21799#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 21932#L533-72 assume !(0 == assert_~arg#1 % 256); 22022#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 22003#L508-2 [2024-11-19 15:05:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 6 times [2024-11-19 15:05:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:20,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110010694] [2024-11-19 15:05:20,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:05:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:20,416 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 15:05:20,417 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110010694] [2024-11-19 15:05:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110010694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:20,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101640710] [2024-11-19 15:05:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:20,485 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1921726344, now seen corresponding path program 1 times [2024-11-19 15:05:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048813104] [2024-11-19 15:05:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048813104] [2024-11-19 15:05:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048813104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:20,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:20,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:05:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475340955] [2024-11-19 15:05:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:20,572 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:05:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:05:20,572 INFO L87 Difference]: Start difference. First operand 1020 states and 1624 transitions. cyclomatic complexity: 612 Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:20,689 INFO L93 Difference]: Finished difference Result 1015 states and 1614 transitions. [2024-11-19 15:05:20,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1614 transitions. [2024-11-19 15:05:20,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 309 [2024-11-19 15:05:20,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1614 transitions. [2024-11-19 15:05:20,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2024-11-19 15:05:20,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2024-11-19 15:05:20,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1614 transitions. [2024-11-19 15:05:20,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:20,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1614 transitions. [2024-11-19 15:05:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1614 transitions. [2024-11-19 15:05:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1014. [2024-11-19 15:05:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1014 states have (on average 1.5907297830374754) internal successors, (1613), 1013 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1613 transitions. [2024-11-19 15:05:20,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1014 states and 1613 transitions. [2024-11-19 15:05:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 15:05:20,717 INFO L425 stractBuchiCegarLoop]: Abstraction has 1014 states and 1613 transitions. [2024-11-19 15:05:20,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 15:05:20,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1014 states and 1613 transitions. [2024-11-19 15:05:20,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2024-11-19 15:05:20,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:20,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:20,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:20,722 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] [2024-11-19 15:05:20,723 INFO L745 eck$LassoCheckResult]: Stem: 23991#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 23992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 24211#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24161#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 24035#L126 assume 0 == read_history_bool_~history_id#1; 24036#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 23801#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24228#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 23993#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 23994#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24212#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 24655#L126 assume 0 == read_history_bool_~history_id#1; 24651#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 24646#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24645#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 24644#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 24643#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24628#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 24640#L126 assume 0 == read_history_bool_~history_id#1; 24636#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 24631#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24630#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 24629#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 24627#L71-2 assume !(add_history_type_~var~0#1 < 3); 24055#L71-3 add_history_type_#res#1 := 1; 23798#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 23799#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 24101#L71-6 assume !!(add_history_type_~var~0#1 < 3); 24102#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 24222#L126-3 assume 0 == read_history_bool_~history_id#1; 24213#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 23804#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24187#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 23690#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 23905#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 24091#L71-10 assume !!(add_history_type_~var~0#1 < 3); 23924#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 23768#L126-6 assume 0 == read_history_bool_~history_id#1; 23769#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 23739#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24195#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 23691#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 23692#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 24003#L71-14 assume !!(add_history_type_~var~0#1 < 3); 24116#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 23950#L126-9 assume 0 == read_history_bool_~history_id#1; 23952#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 24042#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 24043#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 23820#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 23863#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 23864#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 23868#L500 assume !(0 == main_~i2~0#1); 24085#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 24046#L508-2 [2024-11-19 15:05:20,723 INFO L747 eck$LassoCheckResult]: Loop: 24046#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 24047#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 23841#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 23842#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 24206#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 24516#L181-2 assume !(0 == write_history_bool_~history_id#1); 24509#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 24506#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 24503#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 24504#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 24626#L181-4 assume !(0 == write_history_bool_~history_id#1); 23969#L186-4 assume !(1 == write_history_bool_~history_id#1); 23970#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 23784#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 23706#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 23707#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 23715#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 23716#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 23869#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 23847#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 24141#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 24107#L249 assume !(0 == ~gate1Failed~0 % 256); 24016#L252 assume !(0 == ~gate2Failed~0 % 256); 24017#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 24120#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 24210#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 24056#L126-12 assume 0 == read_history_bool_~history_id#1; 24050#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 24029#L130-12 assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); 23749#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 24022#L262 assume !(0 == check_~tmp___3~0#1 % 256); 23845#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 24132#L106-7 assume !(3 == read_history_int8_~history_id#1);assume { :begin_inline_assert } true;assert_#in~arg#1 := 0;havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 23865#L533-54 assume !(0 == assert_~arg#1 % 256); 23802#L528-27 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; 23698#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 23699#L301 assume !(check_~tmp___10~0#1 > -2); 24090#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 24186#L106-9 assume 3 == read_history_int8_~history_id#1; 24226#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 23932#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 24030#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 23680#L321-1 check_#res#1 := 1; 23844#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 23976#L533-72 assume !(0 == assert_~arg#1 % 256); 24063#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 24046#L508-2 [2024-11-19 15:05:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 7 times [2024-11-19 15:05:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273839483] [2024-11-19 15:05:20,724 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:05:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273839483] [2024-11-19 15:05:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273839483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647634774] [2024-11-19 15:05:20,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:20,841 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:20,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1204817136, now seen corresponding path program 1 times [2024-11-19 15:05:20,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:20,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23201355] [2024-11-19 15:05:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:20,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23201355] [2024-11-19 15:05:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23201355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667897326] [2024-11-19 15:05:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:20,919 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:20,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:20,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:20,920 INFO L87 Difference]: Start difference. First operand 1014 states and 1613 transitions. cyclomatic complexity: 607 Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:20,976 INFO L93 Difference]: Finished difference Result 972 states and 1550 transitions. [2024-11-19 15:05:20,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 972 states and 1550 transitions. [2024-11-19 15:05:20,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2024-11-19 15:05:20,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 972 states to 972 states and 1550 transitions. [2024-11-19 15:05:20,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-11-19 15:05:20,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2024-11-19 15:05:20,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 972 states and 1550 transitions. [2024-11-19 15:05:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:20,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 972 states and 1550 transitions. [2024-11-19 15:05:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states and 1550 transitions. [2024-11-19 15:05:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2024-11-19 15:05:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 972 states have (on average 1.5946502057613168) internal successors, (1550), 971 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1550 transitions. [2024-11-19 15:05:21,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 972 states and 1550 transitions. [2024-11-19 15:05:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:21,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 972 states and 1550 transitions. [2024-11-19 15:05:21,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 15:05:21,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 972 states and 1550 transitions. [2024-11-19 15:05:21,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2024-11-19 15:05:21,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:21,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:21,008 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:21,008 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] [2024-11-19 15:05:21,008 INFO L745 eck$LassoCheckResult]: Stem: 26153#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 26154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 26084#L71-2 assume !!(add_history_type_~var~0#1 < 3); 25919#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 25920#L126 assume 0 == read_history_bool_~history_id#1; 26188#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 25890#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26143#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 26155#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 26085#L71-2 assume !!(add_history_type_~var~0#1 < 3); 26086#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 26533#L126 assume 0 == read_history_bool_~history_id#1; 26529#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 26524#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26523#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 26522#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 26521#L71-2 assume !!(add_history_type_~var~0#1 < 3); 26323#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 26518#L126 assume 0 == read_history_bool_~history_id#1; 26498#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 26480#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26419#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 26324#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 26322#L71-2 assume !(add_history_type_~var~0#1 < 3); 26212#L71-3 add_history_type_#res#1 := 1; 25891#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 25892#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 25684#L71-6 assume !!(add_history_type_~var~0#1 < 3); 25685#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 26121#L126-3 assume 0 == read_history_bool_~history_id#1; 26087#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 25773#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26015#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 25699#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 26054#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 26226#L71-10 assume !!(add_history_type_~var~0#1 < 3); 26093#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 25843#L126-6 assume 0 == read_history_bool_~history_id#1; 25844#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 25803#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26037#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 25706#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 25707#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 25730#L71-14 assume !!(add_history_type_~var~0#1 < 3); 25731#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 25857#L126-9 assume 0 == read_history_bool_~history_id#1; 26028#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 26029#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 26196#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 25916#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 25980#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 25981#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 26000#L500 assume !(0 == main_~i2~0#1); 26223#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 26205#L508-2 [2024-11-19 15:05:21,008 INFO L747 eck$LassoCheckResult]: Loop: 26205#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 26009#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 25913#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 25938#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 26018#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 25851#L181-2 assume !(0 == write_history_bool_~history_id#1); 25852#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 25963#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 25964#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 26128#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 26418#L181-4 assume !(0 == write_history_bool_~history_id#1); 26136#L186-4 assume !(1 == write_history_bool_~history_id#1); 26137#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 25877#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 25738#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 25725#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 25726#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 25704#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 26001#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 25957#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 25819#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 25690#L249 assume !(0 == ~gate1Failed~0 % 256); 25691#L252 assume !(0 == ~gate2Failed~0 % 256); 25744#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 25745#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 26083#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 26193#L126-12 assume 0 == read_history_bool_~history_id#1; 26207#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 26185#L130-12 assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); 25818#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 26092#L262 assume !(0 == check_~tmp___3~0#1 % 256); 25728#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 25781#L106-7 assume 3 == read_history_int8_~history_id#1; 25816#L107-7 assume !(0 == read_history_int8_~historyIndex#1); 25880#L110-7 assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; 25734#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 25735#L301 assume !(check_~tmp___10~0#1 > -2); 25994#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 26011#L106-9 assume 3 == read_history_int8_~history_id#1; 26140#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 26141#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 26186#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 25677#L321-1 check_#res#1 := 1; 25955#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 25970#L533-72 assume !(0 == assert_~arg#1 % 256); 25971#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 26205#L508-2 [2024-11-19 15:05:21,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 8 times [2024-11-19 15:05:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139477708] [2024-11-19 15:05:21,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:05:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:05:21,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139477708] [2024-11-19 15:05:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139477708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408628461] [2024-11-19 15:05:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:21,079 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:21,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1439793371, now seen corresponding path program 1 times [2024-11-19 15:05:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434175180] [2024-11-19 15:05:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434175180] [2024-11-19 15:05:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434175180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811242421] [2024-11-19 15:05:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:21,158 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:21,159 INFO L87 Difference]: Start difference. First operand 972 states and 1550 transitions. cyclomatic complexity: 586 Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:21,176 INFO L93 Difference]: Finished difference Result 973 states and 1550 transitions. [2024-11-19 15:05:21,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 973 states and 1550 transitions. [2024-11-19 15:05:21,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2024-11-19 15:05:21,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 973 states to 972 states and 1549 transitions. [2024-11-19 15:05:21,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2024-11-19 15:05:21,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2024-11-19 15:05:21,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 972 states and 1549 transitions. [2024-11-19 15:05:21,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:21,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 972 states and 1549 transitions. [2024-11-19 15:05:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states and 1549 transitions. [2024-11-19 15:05:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2024-11-19 15:05:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 972 states have (on average 1.5936213991769548) internal successors, (1549), 971 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1549 transitions. [2024-11-19 15:05:21,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 972 states and 1549 transitions. [2024-11-19 15:05:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:21,201 INFO L425 stractBuchiCegarLoop]: Abstraction has 972 states and 1549 transitions. [2024-11-19 15:05:21,201 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 15:05:21,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 972 states and 1549 transitions. [2024-11-19 15:05:21,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2024-11-19 15:05:21,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:21,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:21,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:21,204 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] [2024-11-19 15:05:21,204 INFO L745 eck$LassoCheckResult]: Stem: 28106#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 28107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 28035#L71-2 assume !!(add_history_type_~var~0#1 < 3); 27871#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 27872#L126 assume 0 == read_history_bool_~history_id#1; 28140#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27842#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 28095#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 28108#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 28036#L71-2 assume !!(add_history_type_~var~0#1 < 3); 28037#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 28518#L126 assume 0 == read_history_bool_~history_id#1; 28504#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 28498#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 28477#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 28476#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 28475#L71-2 assume !!(add_history_type_~var~0#1 < 3); 28272#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 28472#L126 assume 0 == read_history_bool_~history_id#1; 28466#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 28461#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 28368#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 28273#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 28271#L71-2 assume !(add_history_type_~var~0#1 < 3); 28164#L71-3 add_history_type_#res#1 := 1; 27843#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 27844#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 27638#L71-6 assume !!(add_history_type_~var~0#1 < 3); 27639#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 28073#L126-3 assume 0 == read_history_bool_~history_id#1; 28038#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27727#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 27968#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 27653#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 28006#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 28176#L71-10 assume !!(add_history_type_~var~0#1 < 3); 28044#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 27795#L126-6 assume 0 == read_history_bool_~history_id#1; 27796#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27756#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 27989#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 27660#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 27661#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 27684#L71-14 assume !!(add_history_type_~var~0#1 < 3); 27685#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 27809#L126-9 assume 0 == read_history_bool_~history_id#1; 27980#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27981#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 28148#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 27868#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 27933#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 27934#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 27953#L500 assume !(0 == main_~i2~0#1); 28174#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 28157#L508-2 [2024-11-19 15:05:21,205 INFO L747 eck$LassoCheckResult]: Loop: 28157#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 27962#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 27865#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 27890#L345 assume 0 != ~gate1Failed~0 % 256;~g1v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g1v_new~0) % 256 - 256); 27970#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 27803#L181-2 assume !(0 == write_history_bool_~history_id#1); 27804#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 27916#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 27917#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 28080#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 28367#L181-4 assume !(0 == write_history_bool_~history_id#1); 28088#L186-4 assume !(1 == write_history_bool_~history_id#1); 28089#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 27829#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 27692#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 27679#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 27680#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 27658#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 27954#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 27910#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 27771#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 27644#L249 assume !(0 == ~gate1Failed~0 % 256); 27645#L252 assume !(0 == ~gate2Failed~0 % 256); 27698#L255 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; 27699#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 28034#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 28145#L126-12 assume 0 == read_history_bool_~history_id#1; 28159#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 28137#L130-12 assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); 27770#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 28043#L262 assume !(0 == check_~tmp___3~0#1 % 256); 27682#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 27735#L106-7 assume 3 == read_history_int8_~history_id#1; 27768#L107-7 assume !(0 == read_history_int8_~historyIndex#1); 27832#L110-7 assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; 27688#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 27689#L301 assume !(check_~tmp___10~0#1 > -2); 27947#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 27964#L106-9 assume 3 == read_history_int8_~history_id#1; 28092#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 28093#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 28138#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 27631#L321-1 check_#res#1 := 1; 27908#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 27923#L533-72 assume !(0 == assert_~arg#1 % 256); 27924#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 28157#L508-2 [2024-11-19 15:05:21,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 9 times [2024-11-19 15:05:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473633170] [2024-11-19 15:05:21,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:05:21,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,225 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:05:21,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:21,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473633170] [2024-11-19 15:05:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473633170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 15:05:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133217541] [2024-11-19 15:05:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:21,287 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:21,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1049735591, now seen corresponding path program 1 times [2024-11-19 15:05:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558204024] [2024-11-19 15:05:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558204024] [2024-11-19 15:05:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558204024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396073117] [2024-11-19 15:05:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:21,360 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:05:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:21,361 INFO L87 Difference]: Start difference. First operand 972 states and 1549 transitions. cyclomatic complexity: 585 Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:21,388 INFO L93 Difference]: Finished difference Result 1222 states and 1907 transitions. [2024-11-19 15:05:21,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1222 states and 1907 transitions. [2024-11-19 15:05:21,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 520 [2024-11-19 15:05:21,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1222 states to 1202 states and 1876 transitions. [2024-11-19 15:05:21,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 784 [2024-11-19 15:05:21,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 784 [2024-11-19 15:05:21,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1202 states and 1876 transitions. [2024-11-19 15:05:21,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:05:21,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1202 states and 1876 transitions. [2024-11-19 15:05:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states and 1876 transitions. [2024-11-19 15:05:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1027. [2024-11-19 15:05:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1027 states have (on average 1.5881207400194741) internal successors, (1631), 1026 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1631 transitions. [2024-11-19 15:05:21,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1027 states and 1631 transitions. [2024-11-19 15:05:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:05:21,420 INFO L425 stractBuchiCegarLoop]: Abstraction has 1027 states and 1631 transitions. [2024-11-19 15:05:21,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 15:05:21,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1027 states and 1631 transitions. [2024-11-19 15:05:21,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 345 [2024-11-19 15:05:21,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:05:21,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:05:21,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:05:21,425 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] [2024-11-19 15:05:21,425 INFO L745 eck$LassoCheckResult]: Stem: 30315#$Ultimate##0 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(51, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0; 30316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~ret55#1, main_#t~ret56#1, main_#t~post57#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~nondet37#1;assume 0 == main_#t~nondet37#1 || 1 == main_#t~nondet37#1;~gate1Failed~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;~gate2Failed~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;~gate3Failed~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~VALUE1~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~VALUE2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~VALUE3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~gate1Failed_History_0~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;assume 0 == main_#t~nondet44#1 || 1 == main_#t~nondet44#1;~gate1Failed_History_1~0 := (if 0 == main_#t~nondet44#1 % 256 then 0 else 1);havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;assume 0 == main_#t~nondet45#1 || 1 == main_#t~nondet45#1;~gate1Failed_History_2~0 := (if 0 == main_#t~nondet45#1 % 256 then 0 else 1);havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~gate2Failed_History_0~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~gate2Failed_History_1~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;havoc main_#t~nondet48#1;assume 0 == main_#t~nondet48#1 || 1 == main_#t~nondet48#1;~gate2Failed_History_2~0 := (if 0 == main_#t~nondet48#1 % 256 then 0 else 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;assume 0 == main_#t~nondet49#1 || 1 == main_#t~nondet49#1;~gate3Failed_History_0~0 := (if 0 == main_#t~nondet49#1 % 256 then 0 else 1);havoc main_#t~nondet49#1;havoc main_#t~nondet50#1;assume 0 == main_#t~nondet50#1 || 1 == main_#t~nondet50#1;~gate3Failed_History_1~0 := (if 0 == main_#t~nondet50#1 % 256 then 0 else 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;assume 0 == main_#t~nondet51#1 || 1 == main_#t~nondet51#1;~gate3Failed_History_2~0 := (if 0 == main_#t~nondet51#1 % 256 then 0 else 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;~votedValue_History_0~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;~votedValue_History_1~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;havoc main_#t~nondet54#1;~votedValue_History_2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;havoc init_~tmp~1#1;havoc init_~tmp___0~1#1;havoc init_~tmp___1~1#1;havoc init_~tmp___2~1#1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 0;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 30250#L71-2 assume !!(add_history_type_~var~0#1 < 3); 30077#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30078#L126 assume 0 == read_history_bool_~history_id#1; 30348#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30051#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30306#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 30317#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 30251#L71-2 assume !!(add_history_type_~var~0#1 < 3); 30252#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30655#L126 assume 0 == read_history_bool_~history_id#1; 30643#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30637#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30636#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 30635#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 30634#L71-2 assume !!(add_history_type_~var~0#1 < 3); 30536#L72 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30603#L126 assume 0 == read_history_bool_~history_id#1; 30593#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30539#read_history_bool_returnLabel#1 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30538#L74 assume !!(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296)); 30537#L90-2 add_history_type_#t~post8#1 := add_history_type_~var~0#1;add_history_type_~var~0#1 := 1 + add_history_type_#t~post8#1;havoc add_history_type_#t~post8#1; 30535#L71-2 assume !(add_history_type_~var~0#1 < 3); 30369#L71-3 add_history_type_#res#1 := 1; 30052#add_history_type_returnLabel#1 init_#t~ret9#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp~1#1 := init_#t~ret9#1;havoc init_#t~ret9#1; 30053#L210 assume !(0 == init_~tmp~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 1;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 29841#L71-6 assume !!(add_history_type_~var~0#1 < 3); 29842#L72-2 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30283#L126-3 assume 0 == read_history_bool_~history_id#1; 30245#L127-3 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 29932#read_history_bool_returnLabel#4 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30175#L74-1 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 29856#add_history_type_returnLabel#2 init_#t~ret10#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___0~1#1 := init_#t~ret10#1;havoc init_#t~ret10#1; 30217#L214 assume !(0 == init_~tmp___0~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 2;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 30380#L71-10 assume !!(add_history_type_~var~0#1 < 3); 30254#L72-4 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30255#L126-6 assume 0 == read_history_bool_~history_id#1; 30631#L127-6 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30604#read_history_bool_returnLabel#7 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30198#L74-2 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 29863#add_history_type_returnLabel#3 init_#t~ret11#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___1~1#1 := init_#t~ret11#1;havoc init_#t~ret11#1; 29864#L218 assume !(0 == init_~tmp___1~1#1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id#1 := 3;havoc add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;add_history_type_~history_id#1 := add_history_type_#in~history_id#1;havoc add_history_type_~ini_bool~0#1;havoc add_history_type_~ini_int~0#1;havoc add_history_type_~var~0#1;havoc add_history_type_~tmp~0#1;havoc add_history_type_~tmp___0~0#1;havoc add_history_type_~tmp___1~0#1;havoc add_history_type_~tmp___2~0#1;add_history_type_~ini_bool~0#1 := 0;add_history_type_~ini_int~0#1 := -2;add_history_type_~var~0#1 := 0; 29887#L71-14 assume !!(add_history_type_~var~0#1 < 3); 29888#L72-6 assume 0 == add_history_type_~history_id#1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 0;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30016#L126-9 assume 0 == read_history_bool_~history_id#1; 30489#L127-9 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30480#read_history_bool_returnLabel#10 add_history_type_#t~ret4#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0#1 := (if add_history_type_#t~ret4#1 % 256 % 4294967296 <= 2147483647 then add_history_type_#t~ret4#1 % 256 % 4294967296 else add_history_type_#t~ret4#1 % 256 % 4294967296 - 4294967296);havoc add_history_type_#t~ret4#1; 30381#L74-3 assume !(add_history_type_~tmp~0#1 == (if add_history_type_~ini_bool~0#1 % 256 % 4294967296 <= 2147483647 then add_history_type_~ini_bool~0#1 % 256 % 4294967296 else add_history_type_~ini_bool~0#1 % 256 % 4294967296 - 4294967296));add_history_type_#res#1 := 0; 30074#add_history_type_returnLabel#4 init_#t~ret12#1 := add_history_type_#res#1;havoc add_history_type_#t~ret4#1, add_history_type_#t~ret5#1, add_history_type_#t~ret6#1, add_history_type_#t~ret7#1, add_history_type_#t~post8#1, add_history_type_~history_id#1, add_history_type_~ini_bool~0#1, add_history_type_~ini_int~0#1, add_history_type_~var~0#1, add_history_type_~tmp~0#1, add_history_type_~tmp___0~0#1, add_history_type_~tmp___1~0#1, add_history_type_~tmp___2~0#1;havoc add_history_type_#in~history_id#1;assume { :end_inline_add_history_type } true;init_~tmp___2~1#1 := init_#t~ret12#1;havoc init_#t~ret12#1; 30139#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 30140#init_returnLabel#1 main_#t~ret55#1 := init_#res#1;havoc init_#t~ret9#1, init_#t~ret10#1, init_#t~ret11#1, init_#t~ret12#1, init_~tmp~1#1, init_~tmp___0~1#1, init_~tmp___1~1#1, init_~tmp___2~1#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret55#1;havoc main_#t~ret55#1; 30158#L500 assume !(0 == main_~i2~0#1); 30379#L500-2 ~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 30363#L508-2 [2024-11-19 15:05:21,426 INFO L747 eck$LassoCheckResult]: Loop: 30363#L508-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_~next_state~0#1;havoc gate1_each_pals_period_~tmp~3#1;havoc gate1_each_pals_period_~tmp___0~3#1;havoc gate1_each_pals_period_#t~nondet31#1;assume 0 == gate1_each_pals_period_#t~nondet31#1 || 1 == gate1_each_pals_period_#t~nondet31#1;~gate1Failed~0 := (if 0 == gate1_each_pals_period_#t~nondet31#1 % 256 then 0 else 1);havoc gate1_each_pals_period_#t~nondet31#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 0, (if 0 == ~gate1Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 30169#L181 assume 0 == write_history_bool_~history_id#1;~gate1Failed_History_2~0 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1);~gate1Failed_History_1~0 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1);~gate1Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 30071#L191-2 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 30096#L345 assume !(0 != ~gate1Failed~0 % 256);havoc gate1_each_pals_period_#t~nondet32#1;gate1_each_pals_period_~tmp~3#1 := gate1_each_pals_period_#t~nondet32#1;havoc gate1_each_pals_period_#t~nondet32#1;gate1_each_pals_period_~next_state~0#1 := gate1_each_pals_period_~tmp~3#1; 30083#L351 assume 0 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; 30049#L357-2 assume !(0 == (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256); 30309#L362-1 ~g1v_new~0 := (if (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 <= 127 then (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 else (if gate1_each_pals_period_~next_state~0#1 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0 then gate1_each_pals_period_~next_state~0#1 else ~g1v_new~0) % 256 - 256); 30178#gate1_each_pals_period_returnLabel#1 havoc gate1_each_pals_period_#t~nondet31#1, gate1_each_pals_period_#t~nondet32#1, gate1_each_pals_period_~next_state~0#1, gate1_each_pals_period_~tmp~3#1, gate1_each_pals_period_~tmp___0~3#1;assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_~next_state~1#1;havoc gate2_each_pals_period_~tmp~4#1;havoc gate2_each_pals_period_~tmp___0~4#1;havoc gate2_each_pals_period_#t~nondet33#1;assume 0 == gate2_each_pals_period_#t~nondet33#1 || 1 == gate2_each_pals_period_#t~nondet33#1;~gate2Failed~0 := (if 0 == gate2_each_pals_period_#t~nondet33#1 % 256 then 0 else 1);havoc gate2_each_pals_period_#t~nondet33#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 1, (if 0 == ~gate2Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 30010#L181-2 assume !(0 == write_history_bool_~history_id#1); 30011#L186-2 assume 1 == write_history_bool_~history_id#1;~gate2Failed_History_2~0 := (if 0 == ~gate2Failed_History_1~0 % 256 then 0 else 1);~gate2Failed_History_1~0 := (if 0 == ~gate2Failed_History_0~0 % 256 then 0 else 1);~gate2Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 30121#L191-5 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 30122#L376 assume 0 != ~gate2Failed~0 % 256;~g2v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g2v_new~0) % 256 - 256); 30290#gate2_each_pals_period_returnLabel#1 havoc gate2_each_pals_period_#t~nondet33#1, gate2_each_pals_period_#t~nondet34#1, gate2_each_pals_period_~next_state~1#1, gate2_each_pals_period_~tmp~4#1, gate2_each_pals_period_~tmp___0~4#1;assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_~next_state~2#1;havoc gate3_each_pals_period_~tmp~5#1;havoc gate3_each_pals_period_~tmp___0~5#1;havoc gate3_each_pals_period_#t~nondet35#1;assume 0 == gate3_each_pals_period_#t~nondet35#1 || 1 == gate3_each_pals_period_#t~nondet35#1;~gate3Failed~0 := (if 0 == gate3_each_pals_period_#t~nondet35#1 % 256 then 0 else 1);havoc gate3_each_pals_period_#t~nondet35#1;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1 := 2, (if 0 == ~gate3Failed~0 % 256 then 0 else 1);havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;write_history_bool_~history_id#1 := write_history_bool_#in~history_id#1;write_history_bool_~buf#1 := write_history_bool_#in~buf#1; 30750#L181-4 assume !(0 == write_history_bool_~history_id#1); 30749#L186-4 assume !(1 == write_history_bool_~history_id#1); 30748#L191-6 assume 2 == write_history_bool_~history_id#1;~gate3Failed_History_2~0 := (if 0 == ~gate3Failed_History_1~0 % 256 then 0 else 1);~gate3Failed_History_1~0 := (if 0 == ~gate3Failed_History_0~0 % 256 then 0 else 1);~gate3Failed_History_0~0 := (if 0 == write_history_bool_~buf#1 % 256 then 0 else 1); 30747#L191-8 havoc write_history_bool_~history_id#1, write_history_bool_~buf#1;havoc write_history_bool_#in~history_id#1, write_history_bool_#in~buf#1;assume { :end_inline_write_history_bool } true; 30745#L407 assume 0 != ~gate3Failed~0 % 256;~g3v_new~0 := (if (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 <= 127 then (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 else (if ~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0 then ~nomsg~0 else ~g3v_new~0) % 256 - 256); 30746#gate3_each_pals_period_returnLabel#1 havoc gate3_each_pals_period_#t~nondet35#1, gate3_each_pals_period_#t~nondet36#1, gate3_each_pals_period_~next_state~2#1, gate3_each_pals_period_~tmp~5#1, gate3_each_pals_period_~tmp___0~5#1;assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0#1;havoc voter_~voted_value~0#1;voter_~voted_value~0#1 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 30842#L441 assume ~VALUE1~0 == ~VALUE2~0;voter_~voted_value~0#1 := ~VALUE1~0; 30839#L465-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1 := 3, voter_~voted_value~0#1;havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;write_history_int8_~history_id#1 := write_history_int8_#in~history_id#1;write_history_int8_~buf#1 := write_history_int8_#in~buf#1; 30772#L166 assume 3 == write_history_int8_~history_id#1;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf#1; 30770#L166-2 havoc write_history_int8_~history_id#1, write_history_int8_~buf#1;havoc write_history_int8_#in~history_id#1, write_history_int8_#in~buf#1;assume { :end_inline_write_history_int8 } true; 30769#voter_returnLabel#1 havoc voter_~voted_value~0#1;assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;havoc check_~tmp~2#1;havoc check_~temp_count~0#1;havoc check_~tmp___0~2#1;havoc check_~tmp___1~2#1;havoc check_~tmp___2~2#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; 30686#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 29903#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 30244#L260-1 assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1 := 0, 1;havoc read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;read_history_bool_~history_id#1 := read_history_bool_#in~history_id#1;read_history_bool_~historyIndex#1 := read_history_bool_#in~historyIndex#1; 30354#L126-12 assume 0 == read_history_bool_~history_id#1; 30365#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 30345#L130-12 assume 1 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_1~0 % 256 then 0 else 1); 29976#read_history_bool_returnLabel#13 check_#t~ret13#1 := read_history_bool_#res#1;havoc read_history_bool_~history_id#1, read_history_bool_~historyIndex#1;havoc read_history_bool_#in~history_id#1, read_history_bool_#in~historyIndex#1;assume { :end_inline_read_history_bool } true;check_~tmp___3~0#1 := (if 0 == check_#t~ret13#1 % 256 then 0 else 1);havoc check_#t~ret13#1; 30253#L262 assume !(0 == check_~tmp___3~0#1 % 256); 29885#L262-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 1;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 29940#L106-7 assume 3 == read_history_int8_~history_id#1; 29974#L107-7 assume !(0 == read_history_int8_~historyIndex#1); 30039#L110-7 assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; 29891#read_history_int8_returnLabel#8 check_#t~ret22#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0#1 := check_#t~ret22#1;havoc check_#t~ret22#1; 29892#L301 assume !(check_~tmp___10~0#1 > -2); 30153#L301-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1 := 3, 0;havoc read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;read_history_int8_~history_id#1 := read_history_int8_#in~history_id#1;read_history_int8_~historyIndex#1 := read_history_int8_#in~historyIndex#1; 30171#L106-9 assume 3 == read_history_int8_~history_id#1; 30303#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 30304#read_history_int8_returnLabel#10 check_#t~ret27#1 := read_history_int8_#res#1;havoc read_history_int8_~history_id#1, read_history_int8_~historyIndex#1;havoc read_history_int8_#in~history_id#1, read_history_int8_#in~historyIndex#1;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0#1 := check_#t~ret27#1;havoc check_#t~ret27#1; 30346#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 29834#L321-1 check_#res#1 := 1; 30113#check_returnLabel#1 main_#t~ret56#1 := check_#res#1;havoc check_#t~ret13#1, check_#t~ret14#1, check_#t~ret15#1, check_#t~ret16#1, check_#t~post17#1, check_#t~ret18#1, check_#t~post19#1, check_#t~ret20#1, check_#t~post21#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~2#1, check_~temp_count~0#1, check_~tmp___0~2#1, check_~tmp___1~2#1, check_~tmp___2~2#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;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 30128#L533-72 assume !(0 == assert_~arg#1 % 256); 30129#L528-36 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post57#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post57#1;havoc main_#t~post57#1; 30363#L508-2 [2024-11-19 15:05:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 10 times [2024-11-19 15:05:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064181103] [2024-11-19 15:05:21,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:05:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,444 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:05:21,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:05:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:05:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:05:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064181103] [2024-11-19 15:05:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064181103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:05:21,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:05:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:05:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331458905] [2024-11-19 15:05:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:05:21,467 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:05:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1237801217, now seen corresponding path program 1 times [2024-11-19 15:05:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:05:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239918153] [2024-11-19 15:05:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:05:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:05:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:21,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:05:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:05:21,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:05:24,309 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:24,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:24,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:24,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:24,310 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:05:24,310 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:24,310 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:24,310 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:24,310 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration15_Loop [2024-11-19 15:05:24,310 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:24,310 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:24,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:24,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:25,441 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-11-19 15:05:32,581 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 343 DAG size of output: 123 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-11-19 15:05:33,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:33,280 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:05:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:33,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:33,281 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:33,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 15:05:33,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:33,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:33,297 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:05:33,297 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33#1=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:05:33,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:33,308 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:33,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 15:05:33,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:05:33,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:33,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 15:05:33,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:33,334 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:33,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 15:05:33,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:05:33,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:05:33,362 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:05:33,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 15:05:33,367 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:05:33,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:05:33,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:05:33,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:05:33,367 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:05:33,367 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:33,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:05:33,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:05:33,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c_Iteration15_Loop [2024-11-19 15:05:33,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:05:33,367 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:05:33,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:33,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:05:34,373 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-11-19 15:05:41,077 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 343 DAG size of output: 123 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-11-19 15:05:41,679 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:05:41,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:05:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:41,686 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:41,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 15:05:41,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:41,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:41,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:41,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:41,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:41,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:41,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:41,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:41,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:05:41,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 15:05:41,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:41,721 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:41,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 15:05:41,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:41,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:41,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:41,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:41,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:41,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:41,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:41,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:41,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:05:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:41,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:41,756 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:41,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 15:05:41,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:05:41,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:05:41,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:05:41,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:05:41,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:05:41,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:05:41,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:05:41,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:05:41,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:05:41,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:05:41,781 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:05:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:05:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:05:41,783 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:05:41,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 15:05:41,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:05:41,785 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:05:41,785 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:05:41,785 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2024-11-19 15:05:41,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-19 15:05:41,800 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:05:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:05:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:41,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:05:41,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:05:41,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:05:41,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:05:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:05:42,173 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 15:05:42,173 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1027 states and 1631 transitions. cyclomatic complexity: 612 Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:42,205 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1027 states and 1631 transitions. cyclomatic complexity: 612. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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) Result 1372 states and 2129 transitions. Complement of second has 4 states. [2024-11-19 15:05:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:05:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2024-11-19 15:05:42,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 580 transitions. Stem has 54 letters. Loop has 47 letters. [2024-11-19 15:05:42,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:42,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 580 transitions. Stem has 101 letters. Loop has 47 letters. [2024-11-19 15:05:42,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:42,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 580 transitions. Stem has 54 letters. Loop has 94 letters. [2024-11-19 15:05:42,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:05:42,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1372 states and 2129 transitions. [2024-11-19 15:05:42,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:05:42,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1372 states to 0 states and 0 transitions. [2024-11-19 15:05:42,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 15:05:42,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 15:05:42,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 15:05:42,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:05:42,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:05:42,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:05:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:05:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:05:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:05:42,238 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:05:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:05:42,238 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-19 15:05:42,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:05:42,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 15:05:42,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 15:05:42,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:05:42,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 15:05:42,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 15:05:42,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 15:05:42,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 15:05:42,241 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 15:05:42,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 15:05:42,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 15:05:42,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 03:05:42 BoogieIcfgContainer [2024-11-19 15:05:42,251 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 15:05:42,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 15:05:42,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 15:05:42,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 15:05:42,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:05:14" (3/4) ... [2024-11-19 15:05:42,254 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 15:05:42,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 15:05:42,256 INFO L158 Benchmark]: Toolchain (without parser) took 30503.71ms. Allocated memory was 151.0MB in the beginning and 524.3MB in the end (delta: 373.3MB). Free memory was 102.9MB in the beginning and 464.1MB in the end (delta: -361.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-19 15:05:42,256 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:05:42,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.82ms. Allocated memory is still 151.0MB. Free memory was 102.6MB in the beginning and 84.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 15:05:42,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.40ms. Allocated memory is still 151.0MB. Free memory was 84.1MB in the beginning and 76.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 15:05:42,257 INFO L158 Benchmark]: Boogie Preprocessor took 176.16ms. Allocated memory is still 151.0MB. Free memory was 76.3MB in the beginning and 66.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 15:05:42,257 INFO L158 Benchmark]: RCFGBuilder took 1705.45ms. Allocated memory is still 151.0MB. Free memory was 66.9MB in the beginning and 88.5MB in the end (delta: -21.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-19 15:05:42,257 INFO L158 Benchmark]: BuchiAutomizer took 28103.03ms. Allocated memory was 151.0MB in the beginning and 524.3MB in the end (delta: 373.3MB). Free memory was 88.5MB in the beginning and 464.4MB in the end (delta: -375.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:05:42,258 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 524.3MB. Free memory was 464.4MB in the beginning and 464.1MB in the end (delta: 273.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:05:42,259 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.82ms. Allocated memory is still 151.0MB. Free memory was 102.6MB in the beginning and 84.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.40ms. Allocated memory is still 151.0MB. Free memory was 84.1MB in the beginning and 76.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.16ms. Allocated memory is still 151.0MB. Free memory was 76.3MB in the beginning and 66.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1705.45ms. Allocated memory is still 151.0MB. Free memory was 66.9MB in the beginning and 88.5MB in the end (delta: -21.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 28103.03ms. Allocated memory was 151.0MB in the beginning and 524.3MB in the end (delta: 373.3MB). Free memory was 88.5MB in the beginning and 464.4MB in the end (delta: -375.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 524.3MB. Free memory was 464.4MB in the beginning and 464.1MB in the end (delta: 273.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (15 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (5 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (5 + ((long long) -2 * var)) and consists of 3 locations. One deterministic module has affine ranking function (3 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (3 + ((long long) -2 * var)) and consists of 4 locations. One deterministic module has affine ranking function (19 + ((long long) -2 * i2)) and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.0s and 16 iterations. TraceHistogramMax:3. Analysis of lassos took 25.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 18. Automata minimization 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1513 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5073 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5068 mSDsluCounter, 22346 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11713 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 10633 mSDtfsCounter, 622 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI10 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital73 mio100 ax100 hnf100 lsp75 ukn89 mio100 lsp100 div114 bol100 ite100 ukn100 eq183 hnf99 smp94 dnf3840 smp7 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 15:05:42,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 15:05:42,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE