./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.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 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:41:18,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:41:18,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:41:18,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:41:18,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:41:18,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:41:18,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:41:18,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:41:18,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:41:18,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:41:18,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:41:18,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:41:18,257 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:41:18,257 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:41:18,257 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:41:18,258 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:41:18,258 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:41:18,258 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:41:18,258 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:41:18,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:41:18,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:41:18,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:41:18,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:41:18,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:41:18,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:41:18,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:41:18,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:41:18,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:41:18,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:41:18,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:41:18,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:41:18,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:41:18,263 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:41:18,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:41:18,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:41:18,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:41:18,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:41:18,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:41:18,264 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:41:18,265 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 -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2024-10-25 00:41:18,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:41:18,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:41:18,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:41:18,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:41:18,521 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:41:18,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-10-25 00:41:19,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:41:20,082 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:41:20,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-10-25 00:41:20,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948c933fe/aea63f95308e4436abb458aa97dfe2ee/FLAGb41ff1f77 [2024-10-25 00:41:20,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948c933fe/aea63f95308e4436abb458aa97dfe2ee [2024-10-25 00:41:20,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:41:20,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:41:20,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:41:20,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:41:20,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:41:20,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1670511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20, skipping insertion in model container [2024-10-25 00:41:20,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:41:20,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:41:20,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:41:20,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:41:20,882 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:41:20,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20 WrapperNode [2024-10-25 00:41:20,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:41:20,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:41:20,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:41:20,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:41:20,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,969 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 42, calls inlined = 121, statements flattened = 1620 [2024-10-25 00:41:20,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:41:20,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:41:20,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:41:20,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:41:20,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:20,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-25 00:41:21,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:41:21,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:41:21,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:41:21,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:41:21,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (1/1) ... [2024-10-25 00:41:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:21,166 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-10-25 00:41:21,174 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-10-25 00:41:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:41:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:41:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:41:21,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:41:21,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:41:21,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:41:22,467 INFO L? ?]: Removed 656 outVars from TransFormulas that were not future-live. [2024-10-25 00:41:22,468 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:41:22,507 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:41:22,510 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-25 00:41:22,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:41:22 BoogieIcfgContainer [2024-10-25 00:41:22,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:41:22,512 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:41:22,512 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:41:22,516 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:41:22,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:41:22,516 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:41:20" (1/3) ... [2024-10-25 00:41:22,517 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62c41955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:41:22, skipping insertion in model container [2024-10-25 00:41:22,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:41:22,518 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:41:20" (2/3) ... [2024-10-25 00:41:22,518 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62c41955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:41:22, skipping insertion in model container [2024-10-25 00:41:22,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:41:22,518 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:41:22" (3/3) ... [2024-10-25 00:41:22,520 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-10-25 00:41:22,580 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:41:22,580 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:41:22,581 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:41:22,581 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:41:22,581 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:41:22,581 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:41:22,581 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:41:22,581 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:41:22,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 517 states, 516 states have (on average 1.6608527131782946) internal successors, (857), 516 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:22,620 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 496 [2024-10-25 00:41:22,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:22,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:22,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:41:22,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:22,627 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:41:22,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 517 states, 516 states have (on average 1.6608527131782946) internal successors, (857), 516 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:22,642 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 496 [2024-10-25 00:41:22,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:22,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:22,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:41:22,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:22,652 INFO L745 eck$LassoCheckResult]: Stem: 160#$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; 444#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; 396#L71-2true [2024-10-25 00:41:22,652 INFO L747 eck$LassoCheckResult]: Loop: 396#L71-2true assume !!(add_history_type_~var~0#1 < 3); 326#L72true assume !(0 == add_history_type_~history_id#1); 284#L78true assume !(1 == add_history_type_~history_id#1); 387#L84true assume !(2 == add_history_type_~history_id#1); 391#L90true assume !(3 == add_history_type_~history_id#1); 162#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; 396#L71-2true [2024-10-25 00:41:22,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-25 00:41:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621057181] [2024-10-25 00:41:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:22,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:22,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1279976491, now seen corresponding path program 1 times [2024-10-25 00:41:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520707693] [2024-10-25 00:41:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:22,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:22,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:22,914 INFO L85 PathProgramCache]: Analyzing trace with hash 360025709, now seen corresponding path program 1 times [2024-10-25 00:41:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706420420] [2024-10-25 00:41:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:23,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706420420] [2024-10-25 00:41:23,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706420420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:23,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:23,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:23,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112982088] [2024-10-25 00:41:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:23,178 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:23,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:23,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:23,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:23,179 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:41:23,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:23,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:23,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2024-10-25 00:41:23,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:23,180 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:23,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,320 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:23,321 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:41:23,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,325 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-10-25 00:41:23,328 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-10-25 00:41:23,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:23,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:23,360 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:41:23,360 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-10-25 00:41:23,372 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-10-25 00:41:23,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,374 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-10-25 00:41:23,375 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-10-25 00:41:23,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:23,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:23,390 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:41:23,391 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-10-25 00:41:23,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,413 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-10-25 00:41:23,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:23,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:23,416 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-10-25 00:41:23,439 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-10-25 00:41:23,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,442 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-10-25 00:41:23,443 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-10-25 00:41:23,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:41:23,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:23,476 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:41:23,482 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-10-25 00:41:23,483 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:23,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:23,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:23,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:23,483 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:41:23,483 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,483 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:23,483 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:23,483 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration1_Loop [2024-10-25 00:41:23,483 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:23,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:23,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:23,575 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:23,579 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:41:23,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,582 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-10-25 00:41:23,584 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-10-25 00:41:23,585 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-10-25 00:41:23,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:23,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:23,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:23,597 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-25 00:41:23,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:23,600 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-25 00:41:23,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:23,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:41:23,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,618 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-10-25 00:41:23,620 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-10-25 00:41:23,621 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-10-25 00:41:23,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:23,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:23,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:23,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:23,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:23,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:23,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:23,636 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:41:23,638 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:41:23,638 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:41:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:23,814 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-10-25 00:41:23,815 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-10-25 00:41:23,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:41:23,816 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:41:23,816 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:41:23,817 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-10-25 00:41:23,828 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-10-25 00:41:23,831 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:41:23,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:23,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:41:23,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:23,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:41:23,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:23,981 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-10-25 00:41:23,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 517 states, 516 states have (on average 1.6608527131782946) internal successors, (857), 516 states have internal predecessors, (857), 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-10-25 00:41:24,080 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 517 states, 516 states have (on average 1.6608527131782946) internal successors, (857), 516 states have internal predecessors, (857), 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 1086 states and 1806 transitions. Complement of second has 6 states. [2024-10-25 00:41:24,083 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-10-25 00:41:24,087 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-10-25 00:41:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 956 transitions. [2024-10-25 00:41:24,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 956 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-25 00:41:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 956 transitions. Stem has 8 letters. Loop has 6 letters. [2024-10-25 00:41:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 956 transitions. Stem has 2 letters. Loop has 12 letters. [2024-10-25 00:41:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1086 states and 1806 transitions. [2024-10-25 00:41:24,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 436 [2024-10-25 00:41:24,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1086 states to 557 states and 923 transitions. [2024-10-25 00:41:24,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 503 [2024-10-25 00:41:24,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2024-10-25 00:41:24,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 557 states and 923 transitions. [2024-10-25 00:41:24,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:24,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 557 states and 923 transitions. [2024-10-25 00:41:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states and 923 transitions. [2024-10-25 00:41:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2024-10-25 00:41:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 556 states have (on average 1.658273381294964) internal successors, (922), 555 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 922 transitions. [2024-10-25 00:41:24,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 556 states and 922 transitions. [2024-10-25 00:41:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:24,182 INFO L87 Difference]: Start difference. First operand 556 states and 922 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-10-25 00:41:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:24,268 INFO L93 Difference]: Finished difference Result 466 states and 745 transitions. [2024-10-25 00:41:24,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 466 states and 745 transitions. [2024-10-25 00:41:24,271 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 379 [2024-10-25 00:41:24,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 466 states to 433 states and 712 transitions. [2024-10-25 00:41:24,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2024-10-25 00:41:24,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2024-10-25 00:41:24,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 712 transitions. [2024-10-25 00:41:24,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:24,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 712 transitions. [2024-10-25 00:41:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 712 transitions. [2024-10-25 00:41:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2024-10-25 00:41:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 427 states have (on average 1.6533957845433256) internal successors, (706), 426 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 706 transitions. [2024-10-25 00:41:24,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 427 states and 706 transitions. [2024-10-25 00:41:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:24,290 INFO L425 stractBuchiCegarLoop]: Abstraction has 427 states and 706 transitions. [2024-10-25 00:41:24,290 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:41:24,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 706 transitions. [2024-10-25 00:41:24,292 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 379 [2024-10-25 00:41:24,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:24,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:24,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:24,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:24,294 INFO L745 eck$LassoCheckResult]: Stem: 2907#$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; 2908#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; 3078#L71-2 assume !(add_history_type_~var~0#1 < 3); 2970#L71-3 add_history_type_#res#1 := 1; 2778#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; 2779#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; 3085#L71-6 [2024-10-25 00:41:24,294 INFO L747 eck$LassoCheckResult]: Loop: 3085#L71-6 assume !!(add_history_type_~var~0#1 < 3); 3099#L72-2 assume !(0 == add_history_type_~history_id#1); 2917#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); 2986#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; 3085#L71-6 [2024-10-25 00:41:24,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash 889876098, now seen corresponding path program 1 times [2024-10-25 00:41:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84960049] [2024-10-25 00:41:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:24,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:24,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84960049] [2024-10-25 00:41:24,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84960049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:24,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:24,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285043625] [2024-10-25 00:41:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:24,380 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 500074283, now seen corresponding path program 1 times [2024-10-25 00:41:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:24,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895310203] [2024-10-25 00:41:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:24,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:24,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:24,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:24,419 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:24,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:24,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:24,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:24,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:41:24,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:24,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:24,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2024-10-25 00:41:24,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:24,420 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:24,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,508 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:24,508 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:41:24,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:24,510 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-10-25 00:41:24,512 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-10-25 00:41:24,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:24,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:24,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:24,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:24,539 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-10-25 00:41:24,540 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-10-25 00:41:24,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:41:24,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:24,569 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:41:24,575 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-10-25 00:41:24,575 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:24,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:24,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:24,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:24,576 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:41:24,576 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:24,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:24,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration2_Loop [2024-10-25 00:41:24,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:24,576 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:24,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:24,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-25 00:41:24,691 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:24,691 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:41:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:24,693 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-10-25 00:41:24,694 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-10-25 00:41:24,696 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-10-25 00:41:24,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:24,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:24,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:24,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:24,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:24,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:24,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:24,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:41:24,713 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:41:24,713 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:41:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:24,715 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-10-25 00:41:24,719 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-10-25 00:41:24,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:41:24,720 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:41:24,720 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:41:24,720 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-10-25 00:41:24,732 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-10-25 00:41:24,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:41:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:24,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:41:24,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:24,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:41:24,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:24,818 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-10-25 00:41:24,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 427 states and 706 transitions. cyclomatic complexity: 287 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-10-25 00:41:24,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 427 states and 706 transitions. cyclomatic complexity: 287. 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 700 states and 1151 transitions. Complement of second has 5 states. [2024-10-25 00:41:24,847 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-10-25 00:41:24,848 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-10-25 00:41:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-10-25 00:41:24,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 473 transitions. Stem has 6 letters. Loop has 6 letters. [2024-10-25 00:41:24,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 473 transitions. Stem has 12 letters. Loop has 6 letters. [2024-10-25 00:41:24,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 473 transitions. Stem has 6 letters. Loop has 12 letters. [2024-10-25 00:41:24,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:24,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 1151 transitions. [2024-10-25 00:41:24,855 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 538 [2024-10-25 00:41:24,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 697 states and 1142 transitions. [2024-10-25 00:41:24,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 623 [2024-10-25 00:41:24,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2024-10-25 00:41:24,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 697 states and 1142 transitions. [2024-10-25 00:41:24,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:24,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 697 states and 1142 transitions. [2024-10-25 00:41:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states and 1142 transitions. [2024-10-25 00:41:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 479. [2024-10-25 00:41:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 479 states have (on average 1.6513569937369519) internal successors, (791), 478 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 791 transitions. [2024-10-25 00:41:24,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 479 states and 791 transitions. [2024-10-25 00:41:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:24,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:24,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:24,869 INFO L87 Difference]: Start difference. First operand 479 states and 791 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-10-25 00:41:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:24,904 INFO L93 Difference]: Finished difference Result 720 states and 1191 transitions. [2024-10-25 00:41:24,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 720 states and 1191 transitions. [2024-10-25 00:41:24,907 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2024-10-25 00:41:24,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 720 states to 720 states and 1191 transitions. [2024-10-25 00:41:24,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2024-10-25 00:41:24,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2024-10-25 00:41:24,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 1191 transitions. [2024-10-25 00:41:24,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:24,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 720 states and 1191 transitions. [2024-10-25 00:41:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 1191 transitions. [2024-10-25 00:41:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 481. [2024-10-25 00:41:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 481 states have (on average 1.6444906444906444) internal successors, (791), 480 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 791 transitions. [2024-10-25 00:41:24,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 481 states and 791 transitions. [2024-10-25 00:41:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:24,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 481 states and 791 transitions. [2024-10-25 00:41:24,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:41:24,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 791 transitions. [2024-10-25 00:41:24,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2024-10-25 00:41:24,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:24,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:24,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:41:24,926 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] [2024-10-25 00:41:24,927 INFO L745 eck$LassoCheckResult]: Stem: 5322#$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; 5323#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; 5511#L71-2 assume !!(add_history_type_~var~0#1 < 3); 5465#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; 5360#L126 assume 0 == read_history_bool_~history_id#1; 5361#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 5174#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; 5523#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; 5171#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; 5172#L210 assume 0 == init_~tmp~1#1;init_#res#1 := 0; 5223#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; 5224#L496 assume !(0 == main_~i2~0#1); 5374#L496-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; 5314#L504-2 [2024-10-25 00:41:24,931 INFO L747 eck$LassoCheckResult]: Loop: 5314#L504-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; 5385#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); 5205#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; 5206#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); 5317#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; 5154#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); 5155#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; 5479#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); 5514#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; 5483#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; 5094#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); 5095#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; 5106#L441 assume ~VALUE1~0 == ~VALUE2~0; 5108#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 5062#L461-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; 5446#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; 5492#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; 5453#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; 5425#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 5341#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 5510#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; 5390#L126-12 assume 0 == read_history_bool_~history_id#1; 5379#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); 5104#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; 5346#L262 assume !(0 == check_~tmp___3~0#1 % 256); 5347#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; 5445#L106-7 assume 3 == read_history_int8_~history_id#1; 5452#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 5088#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; 5089#L301 assume !(check_~tmp___10~0#1 > -2); 5414#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; 5494#L106-9 assume 3 == read_history_int8_~history_id#1; 5521#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 5146#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; 5356#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 5067#L321-1 check_#res#1 := 1; 5310#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; 5131#L529-72 assume !(0 == assert_~arg#1 % 256); 5132#L524-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; 5314#L504-2 [2024-10-25 00:41:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 417201271, now seen corresponding path program 1 times [2024-10-25 00:41:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021471411] [2024-10-25 00:41:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021471411] [2024-10-25 00:41:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021471411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:41:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977298783] [2024-10-25 00:41:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:24,989 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -971861200, now seen corresponding path program 1 times [2024-10-25 00:41:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371319201] [2024-10-25 00:41:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:25,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:25,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371319201] [2024-10-25 00:41:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371319201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:25,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799022446] [2024-10-25 00:41:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:25,044 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:41:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:41:25,044 INFO L87 Difference]: Start difference. First operand 481 states and 791 transitions. cyclomatic complexity: 318 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-10-25 00:41:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:25,075 INFO L93 Difference]: Finished difference Result 697 states and 1139 transitions. [2024-10-25 00:41:25,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 697 states and 1139 transitions. [2024-10-25 00:41:25,078 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2024-10-25 00:41:25,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 697 states to 695 states and 1134 transitions. [2024-10-25 00:41:25,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 624 [2024-10-25 00:41:25,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 624 [2024-10-25 00:41:25,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 695 states and 1134 transitions. [2024-10-25 00:41:25,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:25,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 695 states and 1134 transitions. [2024-10-25 00:41:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states and 1134 transitions. [2024-10-25 00:41:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 481. [2024-10-25 00:41:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 481 states have (on average 1.636174636174636) internal successors, (787), 480 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 787 transitions. [2024-10-25 00:41:25,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 481 states and 787 transitions. [2024-10-25 00:41:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:41:25,091 INFO L425 stractBuchiCegarLoop]: Abstraction has 481 states and 787 transitions. [2024-10-25 00:41:25,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:41:25,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 787 transitions. [2024-10-25 00:41:25,093 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 324 [2024-10-25 00:41:25,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:25,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:25,094 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-10-25 00:41:25,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:25,095 INFO L745 eck$LassoCheckResult]: Stem: 6508#$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; 6509#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; 6696#L71-2 assume !!(add_history_type_~var~0#1 < 3); 6651#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; 6546#L126 assume 0 == read_history_bool_~history_id#1; 6547#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 6360#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; 6708#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; 6357#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; 6358#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; 6605#L71-6 assume !!(add_history_type_~var~0#1 < 3); 6607#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; 6703#L126-3 assume 0 == read_history_bool_~history_id#1; 6697#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); 6364#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; 6681#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; 6265#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; 6446#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; 6600#L71-10 assume !!(add_history_type_~var~0#1 < 3); 6719#L72-4 [2024-10-25 00:41:25,095 INFO L747 eck$LassoCheckResult]: Loop: 6719#L72-4 assume !(0 == add_history_type_~history_id#1); 6321#L78-4 assume !(1 == add_history_type_~history_id#1); 6323#L84-4 assume !(2 == add_history_type_~history_id#1); 6534#L90-6 assume !(3 == add_history_type_~history_id#1); 6624#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; 6715#L71-10 assume !!(add_history_type_~var~0#1 < 3); 6719#L72-4 [2024-10-25 00:41:25,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:25,095 INFO L85 PathProgramCache]: Analyzing trace with hash -288136996, now seen corresponding path program 1 times [2024-10-25 00:41:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:25,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670805821] [2024-10-25 00:41:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,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-10-25 00:41:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670805821] [2024-10-25 00:41:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670805821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:41:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994933994] [2024-10-25 00:41:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:25,141 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1731815895, now seen corresponding path program 1 times [2024-10-25 00:41:25,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080304419] [2024-10-25 00:41:25,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:25,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:25,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:25,172 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:25,172 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:25,172 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:25,172 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:25,172 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:41:25,172 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,172 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:25,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:25,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2024-10-25 00:41:25,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:25,173 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:25,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,231 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-10-25 00:41:25,271 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:25,271 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:41:25,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,273 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-10-25 00:41:25,274 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-10-25 00:41:25,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:25,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:25,287 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:41:25,288 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-10-25 00:41:25,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,300 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-10-25 00:41:25,301 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-10-25 00:41:25,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:25,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:25,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-25 00:41:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,333 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-10-25 00:41:25,335 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-10-25 00:41:25,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:41:25,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:25,399 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:41:25,403 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-10-25 00:41:25,403 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:25,404 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:25,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:25,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:25,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:41:25,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:25,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:25,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2024-10-25 00:41:25,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:25,404 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:25,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:25,481 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:41:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,482 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-10-25 00:41:25,484 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-10-25 00:41:25,485 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-10-25 00:41:25,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:25,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:25,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:25,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:25,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:25,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:25,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:25,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:41:25,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-25 00:41:25,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,510 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-10-25 00:41:25,512 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-10-25 00:41:25,513 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-10-25 00:41:25,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:25,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:25,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:25,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:25,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:25,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:25,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:25,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:41:25,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:41:25,529 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:41:25,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,533 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-10-25 00:41:25,534 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-10-25 00:41:25,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:41:25,535 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:41:25,535 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:41:25,535 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-10-25 00:41:25,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:25,547 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:41:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:41:25,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:41:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:25,661 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-10-25 00:41:25,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 481 states and 787 transitions. cyclomatic complexity: 314 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-10-25 00:41:25,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 481 states and 787 transitions. cyclomatic complexity: 314. 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 537 states and 883 transitions. Complement of second has 7 states. [2024-10-25 00:41:25,685 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-10-25 00:41:25,686 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-10-25 00:41:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-10-25 00:41:25,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 19 letters. Loop has 6 letters. [2024-10-25 00:41:25,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:25,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 25 letters. Loop has 6 letters. [2024-10-25 00:41:25,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:25,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 217 transitions. Stem has 19 letters. Loop has 12 letters. [2024-10-25 00:41:25,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:25,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 883 transitions. [2024-10-25 00:41:25,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2024-10-25 00:41:25,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 536 states and 879 transitions. [2024-10-25 00:41:25,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 408 [2024-10-25 00:41:25,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2024-10-25 00:41:25,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 879 transitions. [2024-10-25 00:41:25,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:25,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 536 states and 879 transitions. [2024-10-25 00:41:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 879 transitions. [2024-10-25 00:41:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-10-25 00:41:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 533 states have (on average 1.6435272045028142) internal successors, (876), 532 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 876 transitions. [2024-10-25 00:41:25,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 533 states and 876 transitions. [2024-10-25 00:41:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:41:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:41:25,698 INFO L87 Difference]: Start difference. First operand 533 states and 876 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-10-25 00:41:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:25,737 INFO L93 Difference]: Finished difference Result 538 states and 880 transitions. [2024-10-25 00:41:25,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 880 transitions. [2024-10-25 00:41:25,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2024-10-25 00:41:25,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 522 states and 854 transitions. [2024-10-25 00:41:25,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2024-10-25 00:41:25,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2024-10-25 00:41:25,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 854 transitions. [2024-10-25 00:41:25,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:25,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 854 transitions. [2024-10-25 00:41:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 854 transitions. [2024-10-25 00:41:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2024-10-25 00:41:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 519 states have (on average 1.6396917148362236) internal successors, (851), 518 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 851 transitions. [2024-10-25 00:41:25,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 519 states and 851 transitions. [2024-10-25 00:41:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:41:25,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 519 states and 851 transitions. [2024-10-25 00:41:25,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:41:25,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 519 states and 851 transitions. [2024-10-25 00:41:25,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2024-10-25 00:41:25,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:25,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:25,754 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-10-25 00:41:25,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:41:25,754 INFO L745 eck$LassoCheckResult]: Stem: 8720#$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; 8721#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; 8918#L71-2 assume !!(add_history_type_~var~0#1 < 3); 8875#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; 8765#L126 assume 0 == read_history_bool_~history_id#1; 8766#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 8563#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; 8931#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)); 8722#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; 8723#L71-2 assume !(add_history_type_~var~0#1 < 3); 8795#L71-3 add_history_type_#res#1 := 1; 8560#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; 8561#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; 8828#L71-6 assume !!(add_history_type_~var~0#1 < 3); 8830#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; 8926#L126-3 assume 0 == read_history_bool_~history_id#1; 8919#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); 8565#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; 8901#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; 8452#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; 8651#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; 8778#L71-10 assume !!(add_history_type_~var~0#1 < 3); 8662#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; 8533#L126-6 assume 0 == read_history_bool_~history_id#1; 8534#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); 8502#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; 8908#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; 8456#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; 8457#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; 8730#L71-14 assume !!(add_history_type_~var~0#1 < 3); 8943#L72-6 [2024-10-25 00:41:25,755 INFO L747 eck$LassoCheckResult]: Loop: 8943#L72-6 assume !(0 == add_history_type_~history_id#1); 8916#L78-6 assume !(1 == add_history_type_~history_id#1); 8857#L84-6 assume !(2 == add_history_type_~history_id#1); 8859#L90-9 assume !(3 == add_history_type_~history_id#1); 8742#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; 8865#L71-14 assume !!(add_history_type_~var~0#1 < 3); 8943#L72-6 [2024-10-25 00:41:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -446471529, now seen corresponding path program 1 times [2024-10-25 00:41:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193363122] [2024-10-25 00:41:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193363122] [2024-10-25 00:41:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193363122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:41:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368011185] [2024-10-25 00:41:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:25,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:41:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:25,812 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-10-25 00:41:25,814 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-10-25 00:41:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:25,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 00:41:25,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:25,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:41:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368011185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:41:25,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:41:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-25 00:41:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907655909] [2024-10-25 00:41:25,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:41:25,941 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 951913687, now seen corresponding path program 1 times [2024-10-25 00:41:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521998378] [2024-10-25 00:41:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:25,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:25,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:25,986 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:25,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:25,986 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:25,986 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:25,986 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:41:25,986 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:25,986 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:25,986 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:25,986 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2024-10-25 00:41:25,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:25,987 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:25,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:25,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:26,058 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:26,059 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:41:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:26,063 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-10-25 00:41:26,065 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-10-25 00:41:26,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:26,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:26,077 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:41:26,077 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-10-25 00:41:26,088 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-10-25 00:41:26,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:26,089 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-10-25 00:41:26,090 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-10-25 00:41:26,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:26,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:26,115 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-10-25 00:41:26,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:26,116 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-10-25 00:41:26,117 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-10-25 00:41:26,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:41:26,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:26,184 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:41:26,189 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-10-25 00:41:26,189 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:26,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:26,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:26,189 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:26,189 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:41:26,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:26,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:26,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration5_Loop [2024-10-25 00:41:26,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:26,190 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:26,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:26,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:26,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:26,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:26,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:26,288 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:41:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:26,289 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-10-25 00:41:26,290 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-10-25 00:41:26,291 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-10-25 00:41:26,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:26,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:26,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:26,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:26,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:26,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:26,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:26,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:41:26,305 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:41:26,305 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:41:26,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:26,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:26,307 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-10-25 00:41:26,308 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-10-25 00:41:26,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:41:26,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:41:26,309 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:41:26,309 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-10-25 00:41:26,319 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-10-25 00:41:26,320 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:41:26,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:41:26,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:41:26,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:26,443 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-10-25 00:41:26,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 519 states and 851 transitions. cyclomatic complexity: 340 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-10-25 00:41:26,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 519 states and 851 transitions. cyclomatic complexity: 340. 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 575 states and 947 transitions. Complement of second has 7 states. [2024-10-25 00:41:26,471 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-10-25 00:41:26,473 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-10-25 00:41:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-10-25 00:41:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 30 letters. Loop has 6 letters. [2024-10-25 00:41:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 36 letters. Loop has 6 letters. [2024-10-25 00:41:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 310 transitions. Stem has 30 letters. Loop has 12 letters. [2024-10-25 00:41:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:26,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 947 transitions. [2024-10-25 00:41:26,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2024-10-25 00:41:26,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 574 states and 943 transitions. [2024-10-25 00:41:26,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2024-10-25 00:41:26,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2024-10-25 00:41:26,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 943 transitions. [2024-10-25 00:41:26,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:26,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 574 states and 943 transitions. [2024-10-25 00:41:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 943 transitions. [2024-10-25 00:41:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2024-10-25 00:41:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 571 states have (on average 1.6462346760070052) internal successors, (940), 570 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 940 transitions. [2024-10-25 00:41:26,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 571 states and 940 transitions. [2024-10-25 00:41:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:41:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:41:26,492 INFO L87 Difference]: Start difference. First operand 571 states and 940 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-10-25 00:41:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:26,580 INFO L93 Difference]: Finished difference Result 1242 states and 2051 transitions. [2024-10-25 00:41:26,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1242 states and 2051 transitions. [2024-10-25 00:41:26,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2024-10-25 00:41:26,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1242 states to 1234 states and 2027 transitions. [2024-10-25 00:41:26,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 696 [2024-10-25 00:41:26,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 696 [2024-10-25 00:41:26,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 2027 transitions. [2024-10-25 00:41:26,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:26,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1234 states and 2027 transitions. [2024-10-25 00:41:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 2027 transitions. [2024-10-25 00:41:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 920. [2024-10-25 00:41:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 920 states have (on average 1.6489130434782608) internal successors, (1517), 919 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-10-25 00:41:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1517 transitions. [2024-10-25 00:41:26,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 920 states and 1517 transitions. [2024-10-25 00:41:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:41:26,609 INFO L425 stractBuchiCegarLoop]: Abstraction has 920 states and 1517 transitions. [2024-10-25 00:41:26,609 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:41:26,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 920 states and 1517 transitions. [2024-10-25 00:41:26,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2024-10-25 00:41:26,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:26,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:26,617 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-10-25 00:41:26,617 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] [2024-10-25 00:41:26,618 INFO L745 eck$LassoCheckResult]: Stem: 11958#$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; 11959#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; 12185#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12137#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; 12007#L126 assume 0 == read_history_bool_~history_id#1; 12008#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 11782#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; 12200#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)); 11960#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; 11961#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12186#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; 12306#L126 assume 0 == read_history_bool_~history_id#1; 12300#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 12295#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; 12294#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)); 12293#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; 12292#L71-2 assume !!(add_history_type_~var~0#1 < 3); 12277#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; 12291#L126 assume 0 == read_history_bool_~history_id#1; 12285#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 12280#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; 12279#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)); 12278#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; 12276#L71-2 assume !(add_history_type_~var~0#1 < 3); 12037#L71-3 add_history_type_#res#1 := 1; 11779#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; 11780#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; 12075#L71-6 assume !!(add_history_type_~var~0#1 < 3); 12077#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; 12195#L126-3 assume 0 == read_history_bool_~history_id#1; 12187#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); 11784#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; 12165#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; 11669#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; 11878#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; 12022#L71-10 assume !!(add_history_type_~var~0#1 < 3); 11889#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; 11752#L126-6 assume 0 == read_history_bool_~history_id#1; 11753#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); 11719#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; 12173#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; 11670#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; 11671#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; 11970#L71-14 assume !!(add_history_type_~var~0#1 < 3); 12093#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; 11913#L126-9 assume 0 == read_history_bool_~history_id#1; 11915#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); 12017#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; 12018#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; 11796#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; 11832#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 11833#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; 11838#L496 assume !(0 == main_~i2~0#1); 12021#L496-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; 11947#L504-2 [2024-10-25 00:41:26,619 INFO L747 eck$LassoCheckResult]: Loop: 11947#L504-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; 12034#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); 11816#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; 11817#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); 11951#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; 11760#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); 11761#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; 12150#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); 12189#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; 12154#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); 11768#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; 11684#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); 11685#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; 11696#L441 assume ~VALUE1~0 == ~VALUE2~0; 11698#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 11652#L461-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; 12108#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; 12162#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; 12118#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; 12081#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 11984#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 12184#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; 12038#L126-12 assume 0 == read_history_bool_~history_id#1; 12028#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); 11694#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; 11990#L262 assume !(0 == check_~tmp___3~0#1 % 256); 11991#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; 12107#L106-7 assume 3 == read_history_int8_~history_id#1; 12117#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 11678#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; 11679#L301 assume !(check_~tmp___10~0#1 > -2); 12068#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; 12164#L106-9 assume 3 == read_history_int8_~history_id#1; 12198#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 11749#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; 12002#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 11657#L321-1 check_#res#1 := 1; 11943#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; 11727#L529-72 assume !(0 == assert_~arg#1 % 256); 11728#L524-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; 11947#L504-2 [2024-10-25 00:41:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 1 times [2024-10-25 00:41:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537542026] [2024-10-25 00:41:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537542026] [2024-10-25 00:41:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537542026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:26,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:26,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17806733] [2024-10-25 00:41:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:26,731 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -971861200, now seen corresponding path program 2 times [2024-10-25 00:41:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247920440] [2024-10-25 00:41:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247920440] [2024-10-25 00:41:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247920440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276568647] [2024-10-25 00:41:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:26,780 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:26,781 INFO L87 Difference]: Start difference. First operand 920 states and 1517 transitions. cyclomatic complexity: 605 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-10-25 00:41:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:26,811 INFO L93 Difference]: Finished difference Result 920 states and 1515 transitions. [2024-10-25 00:41:26,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 920 states and 1515 transitions. [2024-10-25 00:41:26,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2024-10-25 00:41:26,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 920 states to 920 states and 1515 transitions. [2024-10-25 00:41:26,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2024-10-25 00:41:26,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2024-10-25 00:41:26,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 920 states and 1515 transitions. [2024-10-25 00:41:26,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:26,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 920 states and 1515 transitions. [2024-10-25 00:41:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states and 1515 transitions. [2024-10-25 00:41:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-25 00:41:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 920 states have (on average 1.6467391304347827) internal successors, (1515), 919 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1515 transitions. [2024-10-25 00:41:26,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 920 states and 1515 transitions. [2024-10-25 00:41:26,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:26,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 920 states and 1515 transitions. [2024-10-25 00:41:26,830 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:41:26,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 920 states and 1515 transitions. [2024-10-25 00:41:26,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 214 [2024-10-25 00:41:26,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:26,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:26,835 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-10-25 00:41:26,835 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-10-25 00:41:26,836 INFO L745 eck$LassoCheckResult]: Stem: 13808#$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; 13809#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; 14036#L71-2 assume !!(add_history_type_~var~0#1 < 3); 13987#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; 13857#L126 assume 0 == read_history_bool_~history_id#1; 13858#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 13630#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; 14054#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)); 13810#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; 13811#L71-2 assume !!(add_history_type_~var~0#1 < 3); 14037#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; 14408#L126 assume 0 == read_history_bool_~history_id#1; 14404#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 14399#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; 14398#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)); 14397#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; 14396#L71-2 assume !!(add_history_type_~var~0#1 < 3); 14381#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; 14393#L126 assume 0 == read_history_bool_~history_id#1; 14389#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 14384#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; 14383#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)); 14382#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; 14380#L71-2 assume !(add_history_type_~var~0#1 < 3); 13887#L71-3 add_history_type_#res#1 := 1; 13627#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; 13628#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; 13925#L71-6 assume !!(add_history_type_~var~0#1 < 3); 13927#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; 14048#L126-3 assume 0 == read_history_bool_~history_id#1; 14038#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); 13632#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; 14015#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; 13518#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; 13726#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; 13872#L71-10 assume !!(add_history_type_~var~0#1 < 3); 13737#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; 13601#L126-6 assume 0 == read_history_bool_~history_id#1; 13602#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); 13568#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; 14023#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; 13519#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; 13520#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; 13820#L71-14 assume !!(add_history_type_~var~0#1 < 3); 13942#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; 13970#L126-9 assume 0 == read_history_bool_~history_id#1; 14259#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); 14253#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; 14074#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; 13644#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; 13680#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 13681#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; 13686#L496 assume !(0 == main_~i2~0#1); 13871#L496-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; 13797#L504-2 [2024-10-25 00:41:26,836 INFO L747 eck$LassoCheckResult]: Loop: 13797#L504-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; 13884#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); 13664#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; 13665#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); 13801#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; 13609#L181-2 assume !(0 == write_history_bool_~history_id#1); 13610#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); 13760#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; 14000#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); 14040#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; 14004#L181-4 assume !(0 == write_history_bool_~history_id#1); 13785#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); 13616#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; 13533#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); 13534#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; 13545#L441 assume ~VALUE1~0 == ~VALUE2~0; 13547#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 13501#L461-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; 13957#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; 14012#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; 13968#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; 13930#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 13834#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 14035#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; 13888#L126-12 assume 0 == read_history_bool_~history_id#1; 13878#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); 13543#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; 13840#L262 assume !(0 == check_~tmp___3~0#1 % 256); 13841#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; 13956#L106-7 assume 3 == read_history_int8_~history_id#1; 13967#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 13527#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; 13528#L301 assume !(check_~tmp___10~0#1 > -2); 13918#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; 14014#L106-9 assume 3 == read_history_int8_~history_id#1; 14052#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 13598#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; 13852#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 13506#L321-1 check_#res#1 := 1; 13793#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; 13576#L529-72 assume !(0 == assert_~arg#1 % 256); 13577#L524-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; 13797#L504-2 [2024-10-25 00:41:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 2 times [2024-10-25 00:41:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637184047] [2024-10-25 00:41:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,916 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-10-25 00:41:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:26,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:26,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637184047] [2024-10-25 00:41:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637184047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:26,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451605134] [2024-10-25 00:41:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:26,930 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1913652609, now seen corresponding path program 1 times [2024-10-25 00:41:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554221252] [2024-10-25 00:41:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:26,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554221252] [2024-10-25 00:41:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554221252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512966512] [2024-10-25 00:41:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:26,979 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:26,980 INFO L87 Difference]: Start difference. First operand 920 states and 1515 transitions. cyclomatic complexity: 603 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-10-25 00:41:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:27,012 INFO L93 Difference]: Finished difference Result 918 states and 1511 transitions. [2024-10-25 00:41:27,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 1511 transitions. [2024-10-25 00:41:27,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2024-10-25 00:41:27,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 918 states and 1511 transitions. [2024-10-25 00:41:27,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2024-10-25 00:41:27,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 486 [2024-10-25 00:41:27,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 918 states and 1511 transitions. [2024-10-25 00:41:27,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:27,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 918 states and 1511 transitions. [2024-10-25 00:41:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states and 1511 transitions. [2024-10-25 00:41:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-10-25 00:41:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 918 states have (on average 1.6459694989106755) internal successors, (1511), 917 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1511 transitions. [2024-10-25 00:41:27,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 918 states and 1511 transitions. [2024-10-25 00:41:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:27,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 918 states and 1511 transitions. [2024-10-25 00:41:27,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:41:27,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 918 states and 1511 transitions. [2024-10-25 00:41:27,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2024-10-25 00:41:27,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:27,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:27,036 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-10-25 00:41:27,036 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-10-25 00:41:27,036 INFO L745 eck$LassoCheckResult]: Stem: 15654#$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; 15655#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; 15878#L71-2 assume !!(add_history_type_~var~0#1 < 3); 15879#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; 16248#L126 assume 0 == read_history_bool_~history_id#1; 16244#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15893#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; 15894#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)); 15656#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; 15657#L71-2 assume !!(add_history_type_~var~0#1 < 3); 15830#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; 15703#L126 assume 0 == read_history_bool_~history_id#1; 15704#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 15477#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; 16141#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)); 16140#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; 16139#L71-2 assume !!(add_history_type_~var~0#1 < 3); 16124#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; 16138#L126 assume 0 == read_history_bool_~history_id#1; 16132#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 16127#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; 16126#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)); 16125#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; 16123#L71-2 assume !(add_history_type_~var~0#1 < 3); 15731#L71-3 add_history_type_#res#1 := 1; 15474#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; 15475#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; 15769#L71-6 assume !!(add_history_type_~var~0#1 < 3); 15771#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; 15888#L126-3 assume 0 == read_history_bool_~history_id#1; 15880#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); 15479#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; 15858#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; 15365#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; 15573#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; 15717#L71-10 assume !!(add_history_type_~var~0#1 < 3); 15584#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; 15448#L126-6 assume 0 == read_history_bool_~history_id#1; 15449#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); 15415#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; 15866#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; 15366#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; 15367#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; 15666#L71-14 assume !!(add_history_type_~var~0#1 < 3); 15787#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; 15609#L126-9 assume 0 == read_history_bool_~history_id#1; 15611#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); 15712#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; 15713#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; 15491#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; 15527#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 15528#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; 15533#L496 assume !(0 == main_~i2~0#1); 15716#L496-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; 15643#L504-2 [2024-10-25 00:41:27,037 INFO L747 eck$LassoCheckResult]: Loop: 15643#L504-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; 15728#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); 15511#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; 15512#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); 15647#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; 15456#L181-2 assume !(0 == write_history_bool_~history_id#1); 15457#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); 15607#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; 15843#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); 15882#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; 15847#L181-4 assume !(0 == write_history_bool_~history_id#1); 15632#L186-4 assume !(1 == write_history_bool_~history_id#1); 15633#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); 15463#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; 15380#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); 15381#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; 15392#L441 assume ~VALUE1~0 == ~VALUE2~0; 15394#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 15348#L461-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; 15802#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; 15855#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; 15812#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; 15775#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 15680#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 15877#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; 15732#L126-12 assume 0 == read_history_bool_~history_id#1; 15723#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); 15390#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; 15686#L262 assume !(0 == check_~tmp___3~0#1 % 256); 15687#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; 15801#L106-7 assume 3 == read_history_int8_~history_id#1; 15811#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 15374#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; 15375#L301 assume !(check_~tmp___10~0#1 > -2); 15762#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; 15857#L106-9 assume 3 == read_history_int8_~history_id#1; 15891#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 15445#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; 15698#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 15353#L321-1 check_#res#1 := 1; 15639#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; 15423#L529-72 assume !(0 == assert_~arg#1 % 256); 15424#L524-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; 15643#L504-2 [2024-10-25 00:41:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 3 times [2024-10-25 00:41:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170634113] [2024-10-25 00:41:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170634113] [2024-10-25 00:41:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170634113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885974349] [2024-10-25 00:41:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,112 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:27,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1910786262, now seen corresponding path program 1 times [2024-10-25 00:41:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461113477] [2024-10-25 00:41:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461113477] [2024-10-25 00:41:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461113477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358807721] [2024-10-25 00:41:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,144 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:27,144 INFO L87 Difference]: Start difference. First operand 918 states and 1511 transitions. cyclomatic complexity: 601 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-10-25 00:41:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:27,163 INFO L93 Difference]: Finished difference Result 1116 states and 1828 transitions. [2024-10-25 00:41:27,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1116 states and 1828 transitions. [2024-10-25 00:41:27,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 410 [2024-10-25 00:41:27,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1116 states to 1116 states and 1828 transitions. [2024-10-25 00:41:27,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 684 [2024-10-25 00:41:27,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 684 [2024-10-25 00:41:27,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1116 states and 1828 transitions. [2024-10-25 00:41:27,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:27,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1116 states and 1828 transitions. [2024-10-25 00:41:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states and 1828 transitions. [2024-10-25 00:41:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 959. [2024-10-25 00:41:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 959 states have (on average 1.6371220020855057) internal successors, (1570), 958 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1570 transitions. [2024-10-25 00:41:27,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 959 states and 1570 transitions. [2024-10-25 00:41:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:27,182 INFO L425 stractBuchiCegarLoop]: Abstraction has 959 states and 1570 transitions. [2024-10-25 00:41:27,182 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:41:27,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 959 states and 1570 transitions. [2024-10-25 00:41:27,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 253 [2024-10-25 00:41:27,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:27,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:27,187 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-10-25 00:41:27,187 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-10-25 00:41:27,187 INFO L745 eck$LassoCheckResult]: Stem: 17700#$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; 17701#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; 17933#L71-2 assume !!(add_history_type_~var~0#1 < 3); 17934#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; 18291#L126 assume 0 == read_history_bool_~history_id#1; 18287#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 18282#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; 18281#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)); 17702#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; 17703#L71-2 assume !!(add_history_type_~var~0#1 < 3); 17880#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; 17751#L126 assume 0 == read_history_bool_~history_id#1; 17752#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 17520#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; 17949#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)); 17960#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; 18229#L71-2 assume !!(add_history_type_~var~0#1 < 3); 18074#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; 18226#L126 assume 0 == read_history_bool_~history_id#1; 18222#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 18217#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; 18216#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)); 18215#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; 18073#L71-2 assume !(add_history_type_~var~0#1 < 3); 17782#L71-3 add_history_type_#res#1 := 1; 17517#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; 17518#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; 17818#L71-6 assume !!(add_history_type_~var~0#1 < 3); 17820#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; 17942#L126-3 assume 0 == read_history_bool_~history_id#1; 17931#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); 17522#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; 17909#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; 17408#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; 17616#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; 17765#L71-10 assume !!(add_history_type_~var~0#1 < 3); 17628#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; 17491#L126-6 assume 0 == read_history_bool_~history_id#1; 17492#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); 17458#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; 17919#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; 17409#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; 17410#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; 17712#L71-14 assume !!(add_history_type_~var~0#1 < 3); 17836#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; 17862#L126-9 assume 0 == read_history_bool_~history_id#1; 18026#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); 18020#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; 17968#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; 17534#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; 17570#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 17571#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; 17576#L496 assume !(0 == main_~i2~0#1); 17764#L496-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; 17689#L504-2 [2024-10-25 00:41:27,187 INFO L747 eck$LassoCheckResult]: Loop: 17689#L504-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; 17777#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); 17554#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; 17555#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); 17912#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; 17499#L181-2 assume !(0 == write_history_bool_~history_id#1); 17500#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); 17653#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; 18327#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); 18325#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; 18324#L181-4 assume !(0 == write_history_bool_~history_id#1); 18323#L186-4 assume !(1 == write_history_bool_~history_id#1); 18322#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); 18321#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; 18319#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); 18317#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; 18316#L441 assume ~VALUE1~0 == ~VALUE2~0; 17950#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 17391#L461-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; 17851#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; 17906#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; 17861#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; 17824#L249 assume !(0 == ~gate1Failed~0 % 256); 17726#L252 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2#1 := 1; 17727#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 17930#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; 17780#L126-12 assume 0 == read_history_bool_~history_id#1; 17772#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); 17433#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; 17733#L262 assume !(0 == check_~tmp___3~0#1 % 256); 17734#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; 17850#L106-7 assume 3 == read_history_int8_~history_id#1; 17860#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 17417#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; 17418#L301 assume !(check_~tmp___10~0#1 > -2); 17811#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; 17908#L106-9 assume 3 == read_history_int8_~history_id#1; 17947#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 17488#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; 17746#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 17396#L321-1 check_#res#1 := 1; 17685#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; 17466#L529-72 assume !(0 == assert_~arg#1 % 256); 17467#L524-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; 17689#L504-2 [2024-10-25 00:41:27,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 4 times [2024-10-25 00:41:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908528298] [2024-10-25 00:41:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908528298] [2024-10-25 00:41:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908528298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812215339] [2024-10-25 00:41:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,250 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 947908594, now seen corresponding path program 1 times [2024-10-25 00:41:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074734329] [2024-10-25 00:41:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074734329] [2024-10-25 00:41:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074734329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818748027] [2024-10-25 00:41:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,298 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:27,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:27,299 INFO L87 Difference]: Start difference. First operand 959 states and 1570 transitions. cyclomatic complexity: 619 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-10-25 00:41:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:27,319 INFO L93 Difference]: Finished difference Result 1187 states and 1931 transitions. [2024-10-25 00:41:27,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1187 states and 1931 transitions. [2024-10-25 00:41:27,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 481 [2024-10-25 00:41:27,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1187 states to 1187 states and 1931 transitions. [2024-10-25 00:41:27,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 755 [2024-10-25 00:41:27,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 755 [2024-10-25 00:41:27,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1187 states and 1931 transitions. [2024-10-25 00:41:27,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:27,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1187 states and 1931 transitions. [2024-10-25 00:41:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states and 1931 transitions. [2024-10-25 00:41:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1016. [2024-10-25 00:41:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1016 states have (on average 1.625984251968504) internal successors, (1652), 1015 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1652 transitions. [2024-10-25 00:41:27,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1016 states and 1652 transitions. [2024-10-25 00:41:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:27,342 INFO L425 stractBuchiCegarLoop]: Abstraction has 1016 states and 1652 transitions. [2024-10-25 00:41:27,342 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:41:27,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1016 states and 1652 transitions. [2024-10-25 00:41:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 310 [2024-10-25 00:41:27,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:27,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:27,346 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-10-25 00:41:27,346 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-10-25 00:41:27,346 INFO L745 eck$LassoCheckResult]: Stem: 19852#$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; 19853#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; 20085#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20032#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; 19901#L126 assume 0 == read_history_bool_~history_id#1; 19902#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 19675#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; 20099#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)); 19854#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; 19855#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20086#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; 20354#L126 assume 0 == read_history_bool_~history_id#1; 20350#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 20345#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; 20344#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)); 20343#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; 20342#L71-2 assume !!(add_history_type_~var~0#1 < 3); 20128#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; 20339#L126 assume 0 == read_history_bool_~history_id#1; 20335#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 20330#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; 20328#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)); 20135#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; 20127#L71-2 assume !(add_history_type_~var~0#1 < 3); 19931#L71-3 add_history_type_#res#1 := 1; 19672#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; 19673#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; 19968#L71-6 assume !!(add_history_type_~var~0#1 < 3); 19970#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; 20093#L126-3 assume 0 == read_history_bool_~history_id#1; 20083#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); 19677#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; 20060#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; 19563#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; 19771#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; 19915#L71-10 assume !!(add_history_type_~var~0#1 < 3); 19782#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; 19646#L126-6 assume 0 == read_history_bool_~history_id#1; 19647#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); 19613#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; 20068#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; 19564#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; 19565#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; 19864#L71-14 assume !!(add_history_type_~var~0#1 < 3); 19986#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; 20014#L126-9 assume 0 == read_history_bool_~history_id#1; 20218#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); 20188#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; 20117#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; 19689#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; 19725#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 19726#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; 19731#L496 assume !(0 == main_~i2~0#1); 19914#L496-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; 19841#L504-2 [2024-10-25 00:41:27,346 INFO L747 eck$LassoCheckResult]: Loop: 19841#L504-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; 19926#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); 19709#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; 19710#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); 20078#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; 20517#L181-2 assume !(0 == write_history_bool_~history_id#1); 20513#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); 20512#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; 20511#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); 20115#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; 20050#L181-4 assume !(0 == write_history_bool_~history_id#1); 19830#L186-4 assume !(1 == write_history_bool_~history_id#1); 19831#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); 19661#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; 19578#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); 19579#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; 19590#L441 assume ~VALUE1~0 == ~VALUE2~0; 19592#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 19546#L461-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; 20002#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; 20057#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; 20013#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; 19974#L249 assume !(0 == ~gate1Failed~0 % 256); 19877#L252 assume !(0 == ~gate2Failed~0 % 256); 19878#L255 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2#1 := 1; 19990#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 20082#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; 19929#L126-12 assume 0 == read_history_bool_~history_id#1; 19921#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); 19588#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; 19883#L262 assume !(0 == check_~tmp___3~0#1 % 256); 19884#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; 20001#L106-7 assume 3 == read_history_int8_~history_id#1; 20012#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 19572#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; 19573#L301 assume !(check_~tmp___10~0#1 > -2); 19961#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; 20059#L106-9 assume 3 == read_history_int8_~history_id#1; 20097#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 19643#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; 19896#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 19551#L321-1 check_#res#1 := 1; 19837#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; 19621#L529-72 assume !(0 == assert_~arg#1 % 256); 19622#L524-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; 19841#L504-2 [2024-10-25 00:41:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 5 times [2024-10-25 00:41:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944739532] [2024-10-25 00:41:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944739532] [2024-10-25 00:41:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944739532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108691241] [2024-10-25 00:41:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,416 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:27,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2074740773, now seen corresponding path program 1 times [2024-10-25 00:41:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062439919] [2024-10-25 00:41:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062439919] [2024-10-25 00:41:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062439919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201298180] [2024-10-25 00:41:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,447 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:27,447 INFO L87 Difference]: Start difference. First operand 1016 states and 1652 transitions. cyclomatic complexity: 644 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-10-25 00:41:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:27,468 INFO L93 Difference]: Finished difference Result 1286 states and 2077 transitions. [2024-10-25 00:41:27,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1286 states and 2077 transitions. [2024-10-25 00:41:27,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 580 [2024-10-25 00:41:27,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1286 states to 1286 states and 2077 transitions. [2024-10-25 00:41:27,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 854 [2024-10-25 00:41:27,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 854 [2024-10-25 00:41:27,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1286 states and 2077 transitions. [2024-10-25 00:41:27,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:27,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1286 states and 2077 transitions. [2024-10-25 00:41:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states and 2077 transitions. [2024-10-25 00:41:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1087. [2024-10-25 00:41:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1087 states have (on average 1.6172953081876724) internal successors, (1758), 1086 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1758 transitions. [2024-10-25 00:41:27,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1087 states and 1758 transitions. [2024-10-25 00:41:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:27,493 INFO L425 stractBuchiCegarLoop]: Abstraction has 1087 states and 1758 transitions. [2024-10-25 00:41:27,493 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:41:27,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1087 states and 1758 transitions. [2024-10-25 00:41:27,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2024-10-25 00:41:27,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:27,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:27,496 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-10-25 00:41:27,496 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-10-25 00:41:27,497 INFO L745 eck$LassoCheckResult]: Stem: 22163#$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; 22164#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; 22400#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22346#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; 22211#L126 assume 0 == read_history_bool_~history_id#1; 22212#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 21986#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; 22419#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)); 22165#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; 22166#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22401#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; 22653#L126 assume 0 == read_history_bool_~history_id#1; 22650#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 22645#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; 22644#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)); 22643#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; 22616#L71-2 assume !!(add_history_type_~var~0#1 < 3); 22528#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; 22607#L126 assume 0 == read_history_bool_~history_id#1; 22542#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 22531#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; 22530#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)); 22529#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; 22527#L71-2 assume !(add_history_type_~var~0#1 < 3); 22240#L71-3 add_history_type_#res#1 := 1; 21983#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; 21984#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; 22280#L71-6 assume !!(add_history_type_~var~0#1 < 3); 22282#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; 22410#L126-3 assume 0 == read_history_bool_~history_id#1; 22402#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); 21988#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; 22375#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; 21874#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; 22082#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; 22225#L71-10 assume !!(add_history_type_~var~0#1 < 3); 22093#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; 21957#L126-6 assume 0 == read_history_bool_~history_id#1; 21958#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); 21924#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; 22386#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; 21875#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; 21876#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; 22175#L71-14 assume !!(add_history_type_~var~0#1 < 3); 22299#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; 22328#L126-9 assume 0 == read_history_bool_~history_id#1; 22458#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); 22445#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; 22434#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; 22000#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; 22036#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 22037#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; 22042#L496 assume !(0 == main_~i2~0#1); 22224#L496-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; 22152#L504-2 [2024-10-25 00:41:27,497 INFO L747 eck$LassoCheckResult]: Loop: 22152#L504-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; 22237#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); 22020#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; 22021#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); 22377#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; 21965#L181-2 assume !(0 == write_history_bool_~history_id#1); 21966#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); 22116#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; 22360#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); 22413#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; 22830#L181-4 assume !(0 == write_history_bool_~history_id#1); 22828#L186-4 assume !(1 == write_history_bool_~history_id#1); 22825#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); 22821#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; 22818#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); 22819#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; 22933#L441 assume ~VALUE1~0 == ~VALUE2~0; 22930#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 22924#L461-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; 22923#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; 22922#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; 22921#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; 22286#L249 assume !(0 == ~gate1Failed~0 % 256); 22188#L252 assume !(0 == ~gate2Failed~0 % 256); 22189#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 22303#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 22399#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; 22241#L126-12 assume 0 == read_history_bool_~history_id#1; 22231#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); 21899#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; 22194#L262 assume !(0 == check_~tmp___3~0#1 % 256); 22195#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; 22314#L106-7 assume 3 == read_history_int8_~history_id#1; 22325#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 21883#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; 21884#L301 assume !(check_~tmp___10~0#1 > -2); 22273#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; 22374#L106-9 assume 3 == read_history_int8_~history_id#1; 22417#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 21954#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; 22206#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 21862#L321-1 check_#res#1 := 1; 22148#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#L529-72 assume !(0 == assert_~arg#1 % 256); 21933#L524-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; 22152#L504-2 [2024-10-25 00:41:27,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 6 times [2024-10-25 00:41:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929067399] [2024-10-25 00:41:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929067399] [2024-10-25 00:41:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929067399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680460656] [2024-10-25 00:41:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,567 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:27,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1652038947, now seen corresponding path program 1 times [2024-10-25 00:41:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659084905] [2024-10-25 00:41:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659084905] [2024-10-25 00:41:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659084905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:41:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341495726] [2024-10-25 00:41:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,619 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:41:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:41:27,620 INFO L87 Difference]: Start difference. First operand 1087 states and 1758 transitions. cyclomatic complexity: 679 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-10-25 00:41:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:27,918 INFO L93 Difference]: Finished difference Result 1087 states and 1736 transitions. [2024-10-25 00:41:27,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1736 transitions. [2024-10-25 00:41:27,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2024-10-25 00:41:27,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 1087 states and 1736 transitions. [2024-10-25 00:41:27,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 655 [2024-10-25 00:41:27,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 655 [2024-10-25 00:41:27,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1087 states and 1736 transitions. [2024-10-25 00:41:27,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:27,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1087 states and 1736 transitions. [2024-10-25 00:41:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states and 1736 transitions. [2024-10-25 00:41:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1081. [2024-10-25 00:41:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1081 states have (on average 1.6003700277520814) internal successors, (1730), 1080 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1730 transitions. [2024-10-25 00:41:27,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1081 states and 1730 transitions. [2024-10-25 00:41:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:41:27,937 INFO L425 stractBuchiCegarLoop]: Abstraction has 1081 states and 1730 transitions. [2024-10-25 00:41:27,937 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-25 00:41:27,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1730 transitions. [2024-10-25 00:41:27,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-10-25 00:41:27,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:27,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:27,941 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-10-25 00:41:27,941 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-10-25 00:41:27,941 INFO L745 eck$LassoCheckResult]: Stem: 24351#$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; 24352#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; 24583#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24584#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; 25029#L126 assume 0 == read_history_bool_~history_id#1; 25012#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 25002#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; 25000#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)); 24999#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; 24585#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24532#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; 24400#L126 assume 0 == read_history_bool_~history_id#1; 24401#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 24167#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; 24602#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)); 24353#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; 24354#L71-2 assume !!(add_history_type_~var~0#1 < 3); 24987#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; 24998#L126 assume 0 == read_history_bool_~history_id#1; 24994#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 24990#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; 24989#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)); 24988#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; 24986#L71-2 assume !(add_history_type_~var~0#1 < 3); 24429#L71-3 add_history_type_#res#1 := 1; 24164#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; 24165#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; 24469#L71-6 assume !!(add_history_type_~var~0#1 < 3); 24471#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; 24595#L126-3 assume 0 == read_history_bool_~history_id#1; 24586#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); 24169#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; 24560#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; 24056#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; 24267#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; 24414#L71-10 assume !!(add_history_type_~var~0#1 < 3); 24281#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; 24282#L126-6 assume 0 == read_history_bool_~history_id#1; 24616#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); 24105#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; 24568#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; 24057#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; 24058#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; 24364#L71-14 assume !!(add_history_type_~var~0#1 < 3); 24487#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; 24306#L126-9 assume 0 == read_history_bool_~history_id#1; 24308#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); 24409#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; 24410#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; 24181#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; 24217#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 24218#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; 24224#L496 assume !(0 == main_~i2~0#1); 24413#L496-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; 24340#L504-2 [2024-10-25 00:41:27,941 INFO L747 eck$LassoCheckResult]: Loop: 24340#L504-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; 24426#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); 24201#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; 24202#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); 24578#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; 24897#L181-2 assume !(0 == write_history_bool_~history_id#1); 24896#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); 24893#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; 24891#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); 24889#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; 24887#L181-4 assume !(0 == write_history_bool_~history_id#1); 24885#L186-4 assume !(1 == write_history_bool_~history_id#1); 24883#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); 24881#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; 24878#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); 24879#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; 24081#L441 assume ~VALUE1~0 == ~VALUE2~0; 24083#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 24040#L461-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; 24503#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; 24557#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; 24514#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; 24475#L249 assume !(0 == ~gate1Failed~0 % 256); 24377#L252 assume !(0 == ~gate2Failed~0 % 256); 24378#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 24491#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 24582#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; 24430#L126-12 assume 0 == read_history_bool_~history_id#1; 24420#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 24392#L130-12 assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); 24113#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; 24383#L262 assume !(0 == check_~tmp___3~0#1 % 256); 24384#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; 24502#L106-7 assume 3 == read_history_int8_~history_id#1; 24513#L107-7 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 24064#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; 24065#L301 assume !(check_~tmp___10~0#1 > -2); 24461#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; 24559#L106-9 assume 3 == read_history_int8_~history_id#1; 24600#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 24136#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; 24393#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 24045#L321-1 check_#res#1 := 1; 24336#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; 24114#L529-72 assume !(0 == assert_~arg#1 % 256); 24115#L524-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; 24340#L504-2 [2024-10-25 00:41:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 7 times [2024-10-25 00:41:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113392784] [2024-10-25 00:41:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113392784] [2024-10-25 00:41:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113392784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185315117] [2024-10-25 00:41:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:27,999 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1539958717, now seen corresponding path program 1 times [2024-10-25 00:41:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566432454] [2024-10-25 00:41:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566432454] [2024-10-25 00:41:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566432454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401685323] [2024-10-25 00:41:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,030 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:28,031 INFO L87 Difference]: Start difference. First operand 1081 states and 1730 transitions. cyclomatic complexity: 657 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-10-25 00:41:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:28,090 INFO L93 Difference]: Finished difference Result 1082 states and 1730 transitions. [2024-10-25 00:41:28,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1730 transitions. [2024-10-25 00:41:28,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 376 [2024-10-25 00:41:28,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1082 states and 1730 transitions. [2024-10-25 00:41:28,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 650 [2024-10-25 00:41:28,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2024-10-25 00:41:28,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1082 states and 1730 transitions. [2024-10-25 00:41:28,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:28,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1082 states and 1730 transitions. [2024-10-25 00:41:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states and 1730 transitions. [2024-10-25 00:41:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1081. [2024-10-25 00:41:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1081 states have (on average 1.599444958371878) internal successors, (1729), 1080 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1729 transitions. [2024-10-25 00:41:28,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1081 states and 1729 transitions. [2024-10-25 00:41:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:28,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 1081 states and 1729 transitions. [2024-10-25 00:41:28,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-25 00:41:28,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1729 transitions. [2024-10-25 00:41:28,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-10-25 00:41:28,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:28,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:28,112 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-10-25 00:41:28,112 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-10-25 00:41:28,112 INFO L745 eck$LassoCheckResult]: Stem: 26516#$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; 26517#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; 26745#L71-2 assume !!(add_history_type_~var~0#1 < 3); 26695#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; 26566#L126 assume 0 == read_history_bool_~history_id#1; 26567#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 26339#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; 26764#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)); 26518#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; 26519#L71-2 assume !!(add_history_type_~var~0#1 < 3); 26746#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; 27253#L126 assume 0 == read_history_bool_~history_id#1; 27249#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27244#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; 27243#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)); 27242#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; 27241#L71-2 assume !!(add_history_type_~var~0#1 < 3); 27226#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; 27238#L126 assume 0 == read_history_bool_~history_id#1; 27234#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 27229#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; 27228#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)); 27227#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; 27225#L71-2 assume !(add_history_type_~var~0#1 < 3); 26594#L71-3 add_history_type_#res#1 := 1; 26336#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; 26337#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; 26633#L71-6 assume !!(add_history_type_~var~0#1 < 3); 26635#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; 26756#L126-3 assume 0 == read_history_bool_~history_id#1; 26747#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); 26341#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; 26722#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; 26228#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; 26435#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; 26580#L71-10 assume !!(add_history_type_~var~0#1 < 3); 26447#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; 26311#L126-6 assume 0 == read_history_bool_~history_id#1; 26312#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); 26277#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; 26731#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; 26229#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; 26230#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; 26529#L71-14 assume !!(add_history_type_~var~0#1 < 3); 26648#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; 26677#L126-9 assume 0 == read_history_bool_~history_id#1; 27084#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); 27078#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; 26780#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; 26353#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; 26389#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 26390#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; 26395#L496 assume !(0 == main_~i2~0#1); 26579#L496-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; 26505#L504-2 [2024-10-25 00:41:28,112 INFO L747 eck$LassoCheckResult]: Loop: 26505#L504-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; 26591#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); 26373#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; 26374#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); 26740#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; 27035#L181-2 assume !(0 == write_history_bool_~history_id#1); 27034#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); 27031#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; 27029#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); 27027#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; 27025#L181-4 assume !(0 == write_history_bool_~history_id#1); 27023#L186-4 assume !(1 == write_history_bool_~history_id#1); 27021#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); 27019#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; 27016#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); 27017#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; 27167#L441 assume ~VALUE1~0 == ~VALUE2~0; 27164#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 27158#L461-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; 27156#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; 27134#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; 27127#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; 26638#L249 assume !(0 == ~gate1Failed~0 % 256); 26543#L252 assume !(0 == ~gate2Failed~0 % 256); 26544#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 26652#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 26744#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; 26595#L126-12 assume 0 == read_history_bool_~history_id#1; 26586#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 26558#L130-12 assume !(1 == read_history_bool_~historyIndex#1);read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_2~0 % 256 then 0 else 1); 26285#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; 26549#L262 assume !(0 == check_~tmp___3~0#1 % 256); 26550#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; 26663#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; 26673#L529-54 assume !(0 == assert_~arg#1 % 256); 26306#L524-27 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; 26236#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; 26237#L301 assume !(check_~tmp___10~0#1 > -2); 26625#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; 26721#L106-9 assume 3 == read_history_int8_~history_id#1; 26762#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 26308#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; 26559#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 26217#L321-1 check_#res#1 := 1; 26501#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; 26286#L529-72 assume !(0 == assert_~arg#1 % 256); 26287#L524-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; 26505#L504-2 [2024-10-25 00:41:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 8 times [2024-10-25 00:41:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329301689] [2024-10-25 00:41:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329301689] [2024-10-25 00:41:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329301689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345684963] [2024-10-25 00:41:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,175 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:28,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2040044714, now seen corresponding path program 1 times [2024-10-25 00:41:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034293708] [2024-10-25 00:41:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034293708] [2024-10-25 00:41:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034293708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188342261] [2024-10-25 00:41:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,212 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:28,212 INFO L87 Difference]: Start difference. First operand 1081 states and 1729 transitions. cyclomatic complexity: 656 Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-10-25 00:41:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:28,419 INFO L93 Difference]: Finished difference Result 1087 states and 1717 transitions. [2024-10-25 00:41:28,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1717 transitions. [2024-10-25 00:41:28,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 381 [2024-10-25 00:41:28,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 1087 states and 1717 transitions. [2024-10-25 00:41:28,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 655 [2024-10-25 00:41:28,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 655 [2024-10-25 00:41:28,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1087 states and 1717 transitions. [2024-10-25 00:41:28,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:28,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1087 states and 1717 transitions. [2024-10-25 00:41:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states and 1717 transitions. [2024-10-25 00:41:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1081. [2024-10-25 00:41:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1081 states have (on average 1.5827937095282145) internal successors, (1711), 1080 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1711 transitions. [2024-10-25 00:41:28,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1081 states and 1711 transitions. [2024-10-25 00:41:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:28,443 INFO L425 stractBuchiCegarLoop]: Abstraction has 1081 states and 1711 transitions. [2024-10-25 00:41:28,443 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-25 00:41:28,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1711 transitions. [2024-10-25 00:41:28,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-10-25 00:41:28,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:28,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:28,447 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-10-25 00:41:28,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:41:28,448 INFO L745 eck$LassoCheckResult]: Stem: 28700#$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; 28701#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; 28932#L71-2 assume !!(add_history_type_~var~0#1 < 3); 28933#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; 29378#L126 assume 0 == read_history_bool_~history_id#1; 29361#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 29351#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; 29349#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)); 29348#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; 28934#L71-2 assume !!(add_history_type_~var~0#1 < 3); 28881#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; 28749#L126 assume 0 == read_history_bool_~history_id#1; 28750#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 28516#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; 28950#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)); 28702#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; 28703#L71-2 assume !!(add_history_type_~var~0#1 < 3); 29336#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; 29347#L126 assume 0 == read_history_bool_~history_id#1; 29343#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 29339#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; 29338#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)); 29337#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; 29335#L71-2 assume !(add_history_type_~var~0#1 < 3); 28778#L71-3 add_history_type_#res#1 := 1; 28513#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; 28514#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; 28818#L71-6 assume !!(add_history_type_~var~0#1 < 3); 28820#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; 28944#L126-3 assume 0 == read_history_bool_~history_id#1; 28935#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); 28518#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; 28909#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; 28405#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; 28616#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; 28763#L71-10 assume !!(add_history_type_~var~0#1 < 3); 28630#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; 28631#L126-6 assume 0 == read_history_bool_~history_id#1; 28964#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); 28454#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; 28917#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; 28406#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; 28407#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; 28713#L71-14 assume !!(add_history_type_~var~0#1 < 3); 28836#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; 28655#L126-9 assume 0 == read_history_bool_~history_id#1; 28657#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); 28758#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; 28759#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; 28530#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; 28566#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 28567#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; 28573#L496 assume !(0 == main_~i2~0#1); 28762#L496-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; 28689#L504-2 [2024-10-25 00:41:28,448 INFO L747 eck$LassoCheckResult]: Loop: 28689#L504-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; 28775#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); 28550#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; 28551#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); 28927#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; 29246#L181-2 assume !(0 == write_history_bool_~history_id#1); 29245#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); 29242#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; 29239#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); 29237#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; 29235#L181-4 assume !(0 == write_history_bool_~history_id#1); 29233#L186-4 assume !(1 == write_history_bool_~history_id#1); 29231#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); 29229#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; 29226#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); 29227#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; 28430#L441 assume ~VALUE1~0 == ~VALUE2~0; 28432#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 28389#L461-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; 28852#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; 28906#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; 28863#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; 28824#L249 assume !(0 == ~gate1Failed~0 % 256); 28726#L252 assume !(0 == ~gate2Failed~0 % 256); 28727#L255 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2#1 := 0; 28840#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 28931#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; 28779#L126-12 assume 0 == read_history_bool_~history_id#1; 28769#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 28741#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); 28462#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; 28732#L262 assume !(0 == check_~tmp___3~0#1 % 256); 28733#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; 28851#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; 28861#L529-54 assume !(0 == assert_~arg#1 % 256); 28483#L524-27 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; 28413#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; 28414#L301 assume !(check_~tmp___10~0#1 > -2); 28810#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; 28908#L106-9 assume 3 == read_history_int8_~history_id#1; 28948#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 28485#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; 28742#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 28394#L321-1 check_#res#1 := 1; 28685#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; 28463#L529-72 assume !(0 == assert_~arg#1 % 256); 28464#L524-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; 28689#L504-2 [2024-10-25 00:41:28,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 9 times [2024-10-25 00:41:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318271551] [2024-10-25 00:41:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318271551] [2024-10-25 00:41:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318271551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015675495] [2024-10-25 00:41:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,524 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:28,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash -45900008, now seen corresponding path program 1 times [2024-10-25 00:41:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781894572] [2024-10-25 00:41:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781894572] [2024-10-25 00:41:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781894572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635634457] [2024-10-25 00:41:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,575 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:28,576 INFO L87 Difference]: Start difference. First operand 1081 states and 1711 transitions. cyclomatic complexity: 638 Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-10-25 00:41:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:28,588 INFO L93 Difference]: Finished difference Result 1082 states and 1711 transitions. [2024-10-25 00:41:28,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1711 transitions. [2024-10-25 00:41:28,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 356 [2024-10-25 00:41:28,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1062 states and 1680 transitions. [2024-10-25 00:41:28,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 630 [2024-10-25 00:41:28,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 630 [2024-10-25 00:41:28,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1062 states and 1680 transitions. [2024-10-25 00:41:28,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:28,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1062 states and 1680 transitions. [2024-10-25 00:41:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states and 1680 transitions. [2024-10-25 00:41:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2024-10-25 00:41:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1062 states have (on average 1.5819209039548023) internal successors, (1680), 1061 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1680 transitions. [2024-10-25 00:41:28,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1062 states and 1680 transitions. [2024-10-25 00:41:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:28,605 INFO L425 stractBuchiCegarLoop]: Abstraction has 1062 states and 1680 transitions. [2024-10-25 00:41:28,605 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-25 00:41:28,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1062 states and 1680 transitions. [2024-10-25 00:41:28,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 356 [2024-10-25 00:41:28,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:28,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:28,608 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-10-25 00:41:28,608 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:41:28,609 INFO L745 eck$LassoCheckResult]: Stem: 30865#$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; 30866#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; 31096#L71-2 assume !!(add_history_type_~var~0#1 < 3); 31047#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; 30915#L126 assume 0 == read_history_bool_~history_id#1; 30916#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 30688#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; 31112#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)); 30867#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; 30868#L71-2 assume !!(add_history_type_~var~0#1 < 3); 31097#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; 31534#L126 assume 0 == read_history_bool_~history_id#1; 31530#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 31525#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; 31121#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)); 31122#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; 31421#L71-2 assume !!(add_history_type_~var~0#1 < 3); 31406#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; 31420#L126 assume 0 == read_history_bool_~history_id#1; 31414#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 31409#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; 31408#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)); 31407#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; 31405#L71-2 assume !(add_history_type_~var~0#1 < 3); 30943#L71-3 add_history_type_#res#1 := 1; 30685#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; 30686#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; 30982#L71-6 assume !!(add_history_type_~var~0#1 < 3); 30984#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; 31106#L126-3 assume 0 == read_history_bool_~history_id#1; 31098#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); 30690#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; 31074#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; 30577#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; 30784#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; 30929#L71-10 assume !!(add_history_type_~var~0#1 < 3); 30796#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; 30660#L126-6 assume 0 == read_history_bool_~history_id#1; 30661#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); 30626#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; 31082#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; 30578#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; 30579#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; 30878#L71-14 assume !!(add_history_type_~var~0#1 < 3); 31000#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; 31030#L126-9 assume 0 == read_history_bool_~history_id#1; 31359#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); 31353#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; 31129#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; 30702#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; 30738#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 30739#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; 30744#L496 assume !(0 == main_~i2~0#1); 30928#L496-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; 30854#L504-2 [2024-10-25 00:41:28,609 INFO L747 eck$LassoCheckResult]: Loop: 30854#L504-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; 30940#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); 30722#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; 30723#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; 31048#L351 assume 0 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; 30954#L357-2 assume !(0 == (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256); 30857#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); 30858#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; 30668#L181-2 assume !(0 == write_history_bool_~history_id#1); 30669#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); 30819#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; 31060#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); 31108#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; 31559#L181-4 assume !(0 == write_history_bool_~history_id#1); 31558#L186-4 assume !(1 == write_history_bool_~history_id#1); 31557#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); 31556#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; 31554#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); 31553#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; 31552#L441 assume ~VALUE1~0 == ~VALUE2~0; 31549#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 31543#L461-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; 31541#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; 31539#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; 31538#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; 31319#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 30893#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 31095#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; 30944#L126-12 assume 0 == read_history_bool_~history_id#1; 30935#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 30907#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); 30634#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; 30898#L262 assume !(0 == check_~tmp___3~0#1 % 256); 30899#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; 31015#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; 31025#L529-54 assume !(0 == assert_~arg#1 % 256); 30655#L524-27 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;read_history_int8_#res#1 := -2; 30585#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; 30586#L301 assume !(check_~tmp___10~0#1 > -2); 30974#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; 31073#L106-9 assume 3 == read_history_int8_~history_id#1; 31110#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 30657#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; 30908#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 30566#L321-1 check_#res#1 := 1; 30850#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; 30635#L529-72 assume !(0 == assert_~arg#1 % 256); 30636#L524-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; 30854#L504-2 [2024-10-25 00:41:28,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 10 times [2024-10-25 00:41:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585975316] [2024-10-25 00:41:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585975316] [2024-10-25 00:41:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585975316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275842669] [2024-10-25 00:41:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,664 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2064228134, now seen corresponding path program 1 times [2024-10-25 00:41:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256676012] [2024-10-25 00:41:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256676012] [2024-10-25 00:41:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256676012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:41:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713519499] [2024-10-25 00:41:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,699 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:41:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:41:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:41:28,699 INFO L87 Difference]: Start difference. First operand 1062 states and 1680 transitions. cyclomatic complexity: 626 Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:28,746 INFO L93 Difference]: Finished difference Result 1020 states and 1617 transitions. [2024-10-25 00:41:28,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1020 states and 1617 transitions. [2024-10-25 00:41:28,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 338 [2024-10-25 00:41:28,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1020 states to 1020 states and 1617 transitions. [2024-10-25 00:41:28,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2024-10-25 00:41:28,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2024-10-25 00:41:28,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1020 states and 1617 transitions. [2024-10-25 00:41:28,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:41:28,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1617 transitions. [2024-10-25 00:41:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states and 1617 transitions. [2024-10-25 00:41:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2024-10-25 00:41:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1020 states have (on average 1.5852941176470587) internal successors, (1617), 1019 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1617 transitions. [2024-10-25 00:41:28,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1020 states and 1617 transitions. [2024-10-25 00:41:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:41:28,767 INFO L425 stractBuchiCegarLoop]: Abstraction has 1020 states and 1617 transitions. [2024-10-25 00:41:28,767 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-25 00:41:28,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1020 states and 1617 transitions. [2024-10-25 00:41:28,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 338 [2024-10-25 00:41:28,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:41:28,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:41:28,769 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-10-25 00:41:28,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:41:28,770 INFO L745 eck$LassoCheckResult]: Stem: 33124#$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; 33125#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; 33055#L71-2 assume !!(add_history_type_~var~0#1 < 3); 32896#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; 32897#L126 assume 0 == read_history_bool_~history_id#1; 33156#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 32868#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; 33115#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)); 33126#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; 33056#L71-2 assume !!(add_history_type_~var~0#1 < 3); 33057#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; 33590#L126 assume 0 == read_history_bool_~history_id#1; 33586#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 33581#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; 33580#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)); 33579#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; 33578#L71-2 assume !!(add_history_type_~var~0#1 < 3); 33563#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; 33575#L126 assume 0 == read_history_bool_~history_id#1; 33571#L127 assume 0 == read_history_bool_~historyIndex#1;read_history_bool_#res#1 := (if 0 == ~gate1Failed_History_0~0 % 256 then 0 else 1); 33566#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; 33565#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)); 33564#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; 33562#L71-2 assume !(add_history_type_~var~0#1 < 3); 33176#L71-3 add_history_type_#res#1 := 1; 32869#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; 32870#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; 32668#L71-6 assume !!(add_history_type_~var~0#1 < 3); 32670#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; 33088#L126-3 assume 0 == read_history_bool_~history_id#1; 33058#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); 32762#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; 32994#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; 32683#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; 33031#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; 33186#L71-10 assume !!(add_history_type_~var~0#1 < 3); 33064#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; 32826#L126-6 assume 0 == read_history_bool_~history_id#1; 32827#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); 32791#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; 33016#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; 32687#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; 32688#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; 32711#L71-14 assume !!(add_history_type_~var~0#1 < 3); 32712#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; 32839#L126-9 assume 0 == read_history_bool_~history_id#1; 33008#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); 32925#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; 33164#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; 32893#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; 32955#L222 assume !(0 == init_~tmp___2~1#1);init_#res#1 := 1; 32956#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; 32978#L496 assume !(0 == main_~i2~0#1); 32985#L496-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; 32986#L504-2 [2024-10-25 00:41:28,772 INFO L747 eck$LassoCheckResult]: Loop: 32986#L504-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; 32989#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); 32890#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; 32914#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; 32903#L351 assume 0 == gate1_each_pals_period_~next_state~0#1;gate1_each_pals_period_~tmp___0~3#1 := 1; 32872#L357-2 assume !(0 == (if 0 == gate1_each_pals_period_~tmp___0~3#1 then 0 else 1) % 256); 33117#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); 33118#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; 33531#L181-2 assume !(0 == write_history_bool_~history_id#1); 33530#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); 33529#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; 33528#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); 33179#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; 32958#L181-4 assume !(0 == write_history_bool_~history_id#1); 32959#L186-4 assume !(1 == write_history_bool_~history_id#1); 33107#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); 32859#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; 32719#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); 32720#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; 33662#L441 assume ~VALUE1~0 == ~VALUE2~0; 33659#L442 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0#1 := ~VALUE3~0; 33653#L461-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; 33627#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; 33166#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; 32803#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; 32804#L249 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2#1 := 1; 32729#L255-2 assume !(0 == (if 0 == check_~tmp~2#1 then 0 else 1) % 256); 33054#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; 33161#L126-12 assume 0 == read_history_bool_~history_id#1; 33167#L127-12 assume !(0 == read_history_bool_~historyIndex#1); 33153#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); 32802#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; 33063#L262 assume !(0 == check_~tmp___3~0#1 % 256); 32709#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; 32769#L106-7 assume 3 == read_history_int8_~history_id#1; 32800#L107-7 assume !(0 == read_history_int8_~historyIndex#1); 32862#L110-7 assume 1 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_1~0; 32715#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; 32716#L301 assume !(check_~tmp___10~0#1 > -2); 32970#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; 32991#L106-9 assume 3 == read_history_int8_~history_id#1; 33112#L107-9 assume 0 == read_history_int8_~historyIndex#1;read_history_int8_#res#1 := ~votedValue_History_0~0; 33113#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; 33154#L321 assume !(check_~tmp___11~0#1 != ~nomsg~0); 32660#L321-1 check_#res#1 := 1; 33110#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; 32805#L529-72 assume !(0 == assert_~arg#1 % 256); 32806#L524-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; 32986#L504-2 [2024-10-25 00:41:28,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,772 INFO L85 PathProgramCache]: Analyzing trace with hash 370697100, now seen corresponding path program 11 times [2024-10-25 00:41:28,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273398807] [2024-10-25 00:41:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-25 00:41:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:41:28,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273398807] [2024-10-25 00:41:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273398807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:41:28,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:41:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:41:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971806407] [2024-10-25 00:41:28,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:41:28,868 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:41:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1995762927, now seen corresponding path program 1 times [2024-10-25 00:41:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:41:28,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131045282] [2024-10-25 00:41:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:41:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:41:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:28,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:41:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:41:28,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:41:31,248 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:31,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:31,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:31,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:31,249 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:41:31,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:31,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:31,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:31,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration16_Loop [2024-10-25 00:41:31,249 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:31,249 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:31,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:31,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:32,206 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-10-25 00:41:38,267 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 345 DAG size of output: 125 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-10-25 00:41:38,847 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:38,847 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:41:38,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:38,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:38,849 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-10-25 00:41:38,851 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-10-25 00:41:38,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:38,852 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:38,862 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:41:38,863 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-10-25 00:41:38,873 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-10-25 00:41:38,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:38,874 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-10-25 00:41:38,876 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-10-25 00:41:38,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:41:38,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:38,898 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-10-25 00:41:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:38,899 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-10-25 00:41:38,900 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-10-25 00:41:38,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:41:38,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:41:38,931 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:41:38,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:38,935 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:41:38,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:41:38,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:41:38,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:41:38,936 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:41:38,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:38,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:41:38,936 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:41:38,936 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c_Iteration16_Loop [2024-10-25 00:41:38,936 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:41:38,936 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:41:38,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:38,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:41:39,792 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-10-25 00:41:46,395 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 345 DAG size of output: 125 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2024-10-25 00:41:46,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:41:46,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:41:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:46,946 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-10-25 00:41:46,947 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-10-25 00:41:46,949 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-10-25 00:41:46,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:46,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:46,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:46,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:46,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:46,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:46,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:46,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:41:46,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:46,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:46,974 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-10-25 00:41:46,975 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-10-25 00:41:46,976 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-10-25 00:41:46,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:41:46,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:41:46,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:41:46,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:41:46,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:41:46,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:41:46,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:41:46,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:41:46,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:41:46,991 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:41:46,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:41:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:41:46,992 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-10-25 00:41:46,994 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-10-25 00:41:46,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:41:46,994 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:41:46,995 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:41:46,995 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-10-25 00:41:47,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-25 00:41:47,007 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:41:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:41:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:47,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:41:47,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:41:47,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:41:47,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:41:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:41:47,278 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-10-25 00:41:47,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1020 states and 1617 transitions. cyclomatic complexity: 605 Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:47,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1020 states and 1617 transitions. cyclomatic complexity: 605. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 1358 states and 2101 transitions. Complement of second has 4 states. [2024-10-25 00:41:47,300 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-10-25 00:41:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:41:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2024-10-25 00:41:47,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 578 transitions. Stem has 54 letters. Loop has 48 letters. [2024-10-25 00:41:47,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:47,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 578 transitions. Stem has 102 letters. Loop has 48 letters. [2024-10-25 00:41:47,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:47,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 578 transitions. Stem has 54 letters. Loop has 96 letters. [2024-10-25 00:41:47,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:41:47,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1358 states and 2101 transitions. [2024-10-25 00:41:47,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:41:47,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1358 states to 0 states and 0 transitions. [2024-10-25 00:41:47,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:41:47,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:41:47,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:41:47,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:41:47,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:41:47,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:41:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:41:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:41:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:41:47,306 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-10-25 00:41:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:41:47,307 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:41:47,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:41:47,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:41:47,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:41:47,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:41:47,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-25 00:41:47,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:41:47,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:41:47,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:41:47,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:41:47 BoogieIcfgContainer [2024-10-25 00:41:47,314 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:41:47,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:41:47,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:41:47,315 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:41:47,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:41:22" (3/4) ... [2024-10-25 00:41:47,316 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:41:47,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:41:47,318 INFO L158 Benchmark]: Toolchain (without parser) took 26861.96ms. Allocated memory was 172.0MB in the beginning and 578.8MB in the end (delta: 406.8MB). Free memory was 98.6MB in the beginning and 390.5MB in the end (delta: -291.9MB). Peak memory consumption was 117.6MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,318 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:41:47,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.31ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 133.3MB in the end (delta: -34.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.18ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 125.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,318 INFO L158 Benchmark]: Boogie Preprocessor took 153.39ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 116.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,319 INFO L158 Benchmark]: RCFGBuilder took 1386.63ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 116.2MB in the beginning and 108.5MB in the end (delta: 7.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,319 INFO L158 Benchmark]: BuchiAutomizer took 24801.73ms. Allocated memory was 213.9MB in the beginning and 578.8MB in the end (delta: 364.9MB). Free memory was 107.5MB in the beginning and 390.5MB in the end (delta: -283.0MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-10-25 00:41:47,319 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 578.8MB. Free memory is still 390.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:41:47,320 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.16ms. Allocated memory is still 172.0MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.31ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 133.3MB in the end (delta: -34.9MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.18ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 125.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.39ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 116.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1386.63ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 116.2MB in the beginning and 108.5MB in the end (delta: 7.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 24801.73ms. Allocated memory was 213.9MB in the beginning and 578.8MB in the end (delta: 364.9MB). Free memory was 107.5MB in the beginning and 390.5MB in the end (delta: -283.0MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 578.8MB. Free memory is still 390.5MB. 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 21 terminating modules (16 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. 16 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.7s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 22.1s. Construction of modules took 0.7s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 19. Automata minimization 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 1541 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s 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, 4920 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4915 mSDsluCounter, 23324 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12046 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 11278 mSDtfsCounter, 972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI11 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp75 ukn89 mio100 lsp100 div114 bol100 ite100 ukn100 eq183 hnf99 smp94 dnf3875 smp7 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:41:47,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-25 00:41:47,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-25 00:41:47,750 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