./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -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 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:31:38,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:31:38,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:31:38,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:31:38,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:31:38,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:31:38,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:31:38,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:31:38,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:31:38,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:31:38,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:31:38,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:31:38,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:31:38,486 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:31:38,486 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:31:38,487 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:31:38,487 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:31:38,487 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:31:38,488 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:31:38,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:31:38,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:31:38,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:31:38,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:31:38,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:31:38,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:31:38,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:31:38,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:31:38,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:31:38,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:31:38,492 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:31:38,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:31:38,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:31:38,493 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:31:38,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:31:38,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:31:38,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:31:38,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:31:38,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:31:38,496 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:31:38,496 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2024-11-09 15:31:38,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:31:38,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:31:38,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:31:38,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:31:38,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:31:38,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2024-11-09 15:31:40,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:31:40,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:31:40,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2024-11-09 15:31:40,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fe5174e/4f795e17b68f41f8919edeb47f5cab71/FLAG62fe16e49 [2024-11-09 15:31:40,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fe5174e/4f795e17b68f41f8919edeb47f5cab71 [2024-11-09 15:31:40,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:31:40,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:31:40,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:31:40,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:31:40,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:31:40,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48fce42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40, skipping insertion in model container [2024-11-09 15:31:40,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:31:40,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:31:40,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:31:40,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:31:40,822 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:31:40,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40 WrapperNode [2024-11-09 15:31:40,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:31:40,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:31:40,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:31:40,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:31:40,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,872 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-11-09 15:31:40,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:31:40,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:31:40,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:31:40,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:31:40,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 15:31:40,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:31:40,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:31:40,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:31:40,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:31:40,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (1/1) ... [2024-11-09 15:31:40,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:40,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:31:40,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:31:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:31:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:31:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:31:41,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:31:41,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:31:41,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:31:41,514 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-09 15:31:41,515 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:31:41,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:31:41,529 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:31:41,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:31:41 BoogieIcfgContainer [2024-11-09 15:31:41,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:31:41,531 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:31:41,532 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:31:41,536 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:31:41,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:31:41,539 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:31:40" (1/3) ... [2024-11-09 15:31:41,540 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33254c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:31:41, skipping insertion in model container [2024-11-09 15:31:41,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:31:41,540 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:31:40" (2/3) ... [2024-11-09 15:31:41,540 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33254c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:31:41, skipping insertion in model container [2024-11-09 15:31:41,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:31:41,541 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:31:41" (3/3) ... [2024-11-09 15:31:41,542 INFO L332 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2024-11-09 15:31:41,609 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:31:41,609 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:31:41,610 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:31:41,610 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:31:41,610 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:31:41,610 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:31:41,611 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:31:41,611 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:31:41,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 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-11-09 15:31:41,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2024-11-09 15:31:41,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:41,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:41,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:31:41,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:41,647 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:31:41,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 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-11-09 15:31:41,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2024-11-09 15:31:41,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:41,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:41,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:31:41,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:41,663 INFO L745 eck$LassoCheckResult]: Stem: 25#$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(13, 2); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 30#L59true assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 10#L59-1true mp_add_~nb~0#1 := 4; 11#L69true assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 15#L80-2true [2024-11-09 15:31:41,665 INFO L747 eck$LassoCheckResult]: Loop: 15#L80-2true assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21#L83true assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 52#L83-1true assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6#L89true assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 29#L95-1true assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 40#L99-1true assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 17#L101-1true assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 18#L102-1true mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 15#L80-2true [2024-11-09 15:31:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2024-11-09 15:31:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933984851] [2024-11-09 15:31:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:41,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:41,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:41,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2024-11-09 15:31:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693134685] [2024-11-09 15:31:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:41,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:41,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693134685] [2024-11-09 15:31:41,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693134685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:41,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:31:41,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95954670] [2024-11-09 15:31:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:41,992 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:31:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:31:42,044 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:42,244 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2024-11-09 15:31:42,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. [2024-11-09 15:31:42,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2024-11-09 15:31:42,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 56 states and 86 transitions. [2024-11-09 15:31:42,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-09 15:31:42,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-09 15:31:42,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2024-11-09 15:31:42,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:42,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 86 transitions. [2024-11-09 15:31:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2024-11-09 15:31:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-09 15:31:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2024-11-09 15:31:42,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 84 transitions. [2024-11-09 15:31:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:31:42,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2024-11-09 15:31:42,284 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:31:42,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2024-11-09 15:31:42,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-11-09 15:31:42,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:42,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:42,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:42,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:42,287 INFO L745 eck$LassoCheckResult]: Stem: 174#$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(13, 2); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 135#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 136#L59-1 mp_add_~nb~0#1 := 4; 153#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 146#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 172#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 182#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 180#L83-1 [2024-11-09 15:31:42,287 INFO L747 eck$LassoCheckResult]: Loop: 180#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 139#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 140#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 175#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 178#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 163#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 164#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 158#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 159#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 169#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 156#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 173#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 181#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 180#L83-1 [2024-11-09 15:31:42,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2024-11-09 15:31:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954709616] [2024-11-09 15:31:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954709616] [2024-11-09 15:31:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954709616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477084984] [2024-11-09 15:31:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:42,646 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2024-11-09 15:31:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139418963] [2024-11-09 15:31:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:42,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139418963] [2024-11-09 15:31:42,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139418963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:42,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:42,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967575585] [2024-11-09 15:31:42,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:42,789 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:42,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:31:42,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:31:42,790 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:43,086 INFO L93 Difference]: Finished difference Result 140 states and 215 transitions. [2024-11-09 15:31:43,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 215 transitions. [2024-11-09 15:31:43,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2024-11-09 15:31:43,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 140 states and 215 transitions. [2024-11-09 15:31:43,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2024-11-09 15:31:43,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2024-11-09 15:31:43,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 215 transitions. [2024-11-09 15:31:43,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:43,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 215 transitions. [2024-11-09 15:31:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 215 transitions. [2024-11-09 15:31:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2024-11-09 15:31:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2024-11-09 15:31:43,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 113 transitions. [2024-11-09 15:31:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:31:43,111 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2024-11-09 15:31:43,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:31:43,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2024-11-09 15:31:43,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-11-09 15:31:43,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:43,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:43,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,114 INFO L745 eck$LassoCheckResult]: Stem: 386#$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(13, 2); 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 345#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 347#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 348#L59-1 mp_add_~nb~0#1 := 4; 360#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 384#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 385#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 392#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 414#L83-1 [2024-11-09 15:31:43,114 INFO L747 eck$LassoCheckResult]: Loop: 414#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 416#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 388#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 389#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 415#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 373#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 374#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 394#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 395#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 380#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 364#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 368#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 369#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 414#L83-1 [2024-11-09 15:31:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2024-11-09 15:31:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896347897] [2024-11-09 15:31:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896347897] [2024-11-09 15:31:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896347897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:43,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:31:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295218687] [2024-11-09 15:31:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:43,296 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2024-11-09 15:31:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178557634] [2024-11-09 15:31:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178557634] [2024-11-09 15:31:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178557634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:43,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660755262] [2024-11-09 15:31:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:43,394 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:31:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:31:43,396 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:43,649 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2024-11-09 15:31:43,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 246 transitions. [2024-11-09 15:31:43,652 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 99 [2024-11-09 15:31:43,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 170 states and 246 transitions. [2024-11-09 15:31:43,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2024-11-09 15:31:43,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 170 [2024-11-09 15:31:43,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 246 transitions. [2024-11-09 15:31:43,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:43,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 170 states and 246 transitions. [2024-11-09 15:31:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 246 transitions. [2024-11-09 15:31:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 85. [2024-11-09 15:31:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-09 15:31:43,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-09 15:31:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:31:43,662 INFO L425 stractBuchiCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-09 15:31:43,662 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:31:43,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 123 transitions. [2024-11-09 15:31:43,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-11-09 15:31:43,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:43,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:43,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,665 INFO L745 eck$LassoCheckResult]: Stem: 648#$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(13, 2); 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 610#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 612#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 613#L59-1 mp_add_~nb~0#1 := 4; 677#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 653#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 631#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 632#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 628#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 629#L84-2 [2024-11-09 15:31:43,665 INFO L747 eck$LassoCheckResult]: Loop: 629#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 633#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 622#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 623#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 607#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 608#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 627#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 616#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 617#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 637#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 638#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 652#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 644#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 629#L84-2 [2024-11-09 15:31:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 1 times [2024-11-09 15:31:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754224598] [2024-11-09 15:31:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:43,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:43,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:43,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 119486142, now seen corresponding path program 3 times [2024-11-09 15:31:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713196438] [2024-11-09 15:31:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:43,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713196438] [2024-11-09 15:31:43,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713196438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:43,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:43,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:31:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086684112] [2024-11-09 15:31:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:43,786 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:43,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:31:43,787 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. cyclomatic complexity: 40 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:43,924 INFO L93 Difference]: Finished difference Result 110 states and 164 transitions. [2024-11-09 15:31:43,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 164 transitions. [2024-11-09 15:31:43,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2024-11-09 15:31:43,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 110 states and 164 transitions. [2024-11-09 15:31:43,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2024-11-09 15:31:43,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2024-11-09 15:31:43,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 164 transitions. [2024-11-09 15:31:43,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:43,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-09 15:31:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 164 transitions. [2024-11-09 15:31:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2024-11-09 15:31:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 101 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-11-09 15:31:43,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-11-09 15:31:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:43,940 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-11-09 15:31:43,940 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:31:43,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 150 transitions. [2024-11-09 15:31:43,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2024-11-09 15:31:43,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:43,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:43,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:43,942 INFO L745 eck$LassoCheckResult]: Stem: 851#$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(13, 2); 823#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 812#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 814#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 815#L59-1 mp_add_~nb~0#1 := 4; 828#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 849#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 850#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 909#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 831#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 832#L84-2 [2024-11-09 15:31:43,942 INFO L747 eck$LassoCheckResult]: Loop: 832#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 835#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 824#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 825#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 894#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 874#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 889#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 888#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 842#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 843#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 858#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 859#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 852#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 808#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 809#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 829#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 818#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 819#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 868#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 866#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 867#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 904#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 832#L84-2 [2024-11-09 15:31:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 2 times [2024-11-09 15:31:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246585199] [2024-11-09 15:31:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:43,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:43,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 522403369, now seen corresponding path program 1 times [2024-11-09 15:31:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055935654] [2024-11-09 15:31:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:31:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055935654] [2024-11-09 15:31:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055935654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:44,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:44,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:31:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093670349] [2024-11-09 15:31:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:44,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:31:44,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:31:44,026 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. cyclomatic complexity: 50 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:44,117 INFO L93 Difference]: Finished difference Result 127 states and 184 transitions. [2024-11-09 15:31:44,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 184 transitions. [2024-11-09 15:31:44,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2024-11-09 15:31:44,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 184 transitions. [2024-11-09 15:31:44,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2024-11-09 15:31:44,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2024-11-09 15:31:44,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 184 transitions. [2024-11-09 15:31:44,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:44,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 184 transitions. [2024-11-09 15:31:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 184 transitions. [2024-11-09 15:31:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-09 15:31:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.456) internal successors, (182), 124 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2024-11-09 15:31:44,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-09 15:31:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:31:44,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-09 15:31:44,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:31:44,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 182 transitions. [2024-11-09 15:31:44,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2024-11-09 15:31:44,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:44,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:44,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,138 INFO L745 eck$LassoCheckResult]: Stem: 1086#$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(13, 2); 1059#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 1048#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 1050#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 1051#L59-1 mp_add_~nb~0#1 := 4; 1066#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 1055#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1085#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1082#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1067#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1068#L84-2 [2024-11-09 15:31:44,138 INFO L747 eck$LassoCheckResult]: Loop: 1068#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1084#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1151#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1148#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 1139#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 1112#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1111#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1110#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1106#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1103#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1096#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1097#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 1061#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 1043#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 1044#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1089#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1057#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1058#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1077#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1100#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1101#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1158#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1068#L84-2 [2024-11-09 15:31:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 3 times [2024-11-09 15:31:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737762055] [2024-11-09 15:31:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:44,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 581508713, now seen corresponding path program 1 times [2024-11-09 15:31:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570123857] [2024-11-09 15:31:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570123857] [2024-11-09 15:31:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570123857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676008245] [2024-11-09 15:31:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:44,244 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:31:44,246 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. cyclomatic complexity: 59 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:44,299 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2024-11-09 15:31:44,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 284 transitions. [2024-11-09 15:31:44,301 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2024-11-09 15:31:44,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 284 transitions. [2024-11-09 15:31:44,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2024-11-09 15:31:44,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2024-11-09 15:31:44,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 284 transitions. [2024-11-09 15:31:44,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:44,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 284 transitions. [2024-11-09 15:31:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 284 transitions. [2024-11-09 15:31:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2024-11-09 15:31:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.490909090909091) internal successors, (246), 164 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2024-11-09 15:31:44,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 246 transitions. [2024-11-09 15:31:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:44,318 INFO L425 stractBuchiCegarLoop]: Abstraction has 165 states and 246 transitions. [2024-11-09 15:31:44,319 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:31:44,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. [2024-11-09 15:31:44,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 119 [2024-11-09 15:31:44,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:44,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:44,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,321 INFO L745 eck$LassoCheckResult]: Stem: 1416#$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(13, 2); 1387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 1368#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 1370#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 1371#L59-1 mp_add_~nb~0#1 := 4; 1392#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 1383#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1492#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1491#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1489#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1465#L84-2 [2024-11-09 15:31:44,321 INFO L747 eck$LassoCheckResult]: Loop: 1465#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1490#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1488#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1485#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 1483#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 1450#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1446#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1444#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1442#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1440#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1436#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1437#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 1389#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 1380#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 1419#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1420#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1394#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1404#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1405#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1398#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1399#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1464#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1465#L84-2 [2024-11-09 15:31:44,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,322 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 4 times [2024-11-09 15:31:44,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732728078] [2024-11-09 15:31:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:44,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1412635993, now seen corresponding path program 1 times [2024-11-09 15:31:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711677694] [2024-11-09 15:31:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711677694] [2024-11-09 15:31:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711677694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:31:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072786837] [2024-11-09 15:31:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:44,439 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:31:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:31:44,439 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. cyclomatic complexity: 83 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:44,616 INFO L93 Difference]: Finished difference Result 300 states and 446 transitions. [2024-11-09 15:31:44,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 446 transitions. [2024-11-09 15:31:44,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 249 [2024-11-09 15:31:44,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 300 states and 446 transitions. [2024-11-09 15:31:44,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2024-11-09 15:31:44,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2024-11-09 15:31:44,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 300 states and 446 transitions. [2024-11-09 15:31:44,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:44,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 300 states and 446 transitions. [2024-11-09 15:31:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 446 transitions. [2024-11-09 15:31:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 244. [2024-11-09 15:31:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 244 states have (on average 1.4918032786885247) internal successors, (364), 243 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2024-11-09 15:31:44,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 244 states and 364 transitions. [2024-11-09 15:31:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:31:44,629 INFO L425 stractBuchiCegarLoop]: Abstraction has 244 states and 364 transitions. [2024-11-09 15:31:44,630 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:31:44,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 364 transitions. [2024-11-09 15:31:44,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 196 [2024-11-09 15:31:44,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:44,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:44,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,632 INFO L745 eck$LassoCheckResult]: Stem: 1895#$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(13, 2); 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 1844#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 1846#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 1847#L59-1 mp_add_~nb~0#1 := 4; 1871#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 1859#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2041#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2040#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1872#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1873#L84-2 [2024-11-09 15:31:44,636 INFO L747 eck$LassoCheckResult]: Loop: 1873#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2039#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2038#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2035#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 2033#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 1925#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1926#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1921#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1922#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1917#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1918#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2031#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 2066#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 1856#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 1936#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1932#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 1929#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1927#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1915#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 1916#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1989#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 1974#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 1873#L84-2 [2024-11-09 15:31:44,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 5 times [2024-11-09 15:31:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060057871] [2024-11-09 15:31:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:44,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 983324395, now seen corresponding path program 1 times [2024-11-09 15:31:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306065323] [2024-11-09 15:31:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 15:31:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306065323] [2024-11-09 15:31:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306065323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:31:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082534646] [2024-11-09 15:31:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:44,737 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:31:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:31:44,738 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. cyclomatic complexity: 122 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:44,820 INFO L93 Difference]: Finished difference Result 282 states and 423 transitions. [2024-11-09 15:31:44,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 423 transitions. [2024-11-09 15:31:44,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 234 [2024-11-09 15:31:44,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 282 states and 423 transitions. [2024-11-09 15:31:44,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2024-11-09 15:31:44,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2024-11-09 15:31:44,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 423 transitions. [2024-11-09 15:31:44,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:44,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 423 transitions. [2024-11-09 15:31:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 423 transitions. [2024-11-09 15:31:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 276. [2024-11-09 15:31:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 276 states have (on average 1.5108695652173914) internal successors, (417), 275 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 417 transitions. [2024-11-09 15:31:44,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 276 states and 417 transitions. [2024-11-09 15:31:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:31:44,836 INFO L425 stractBuchiCegarLoop]: Abstraction has 276 states and 417 transitions. [2024-11-09 15:31:44,836 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:31:44,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 417 transitions. [2024-11-09 15:31:44,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 228 [2024-11-09 15:31:44,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:44,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:44,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:44,839 INFO L745 eck$LassoCheckResult]: Stem: 2421#$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(13, 2); 2394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 2376#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 2378#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 2379#L59-1 mp_add_~nb~0#1 := 4; 2401#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 2390#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2563#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2560#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 2545#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 2509#L84-2 [2024-11-09 15:31:44,842 INFO L747 eck$LassoCheckResult]: Loop: 2509#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2554#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2553#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2530#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 2527#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 2452#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2453#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2448#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2449#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2515#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 2432#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2433#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 2595#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 2592#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 2466#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2458#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2457#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 2454#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 2455#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 2434#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2435#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 2511#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 2509#L84-2 [2024-11-09 15:31:44,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 6 times [2024-11-09 15:31:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066585377] [2024-11-09 15:31:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:44,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1040582697, now seen corresponding path program 1 times [2024-11-09 15:31:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199400696] [2024-11-09 15:31:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199400696] [2024-11-09 15:31:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199400696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732359699] [2024-11-09 15:31:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:45,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:45,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 15:31:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:45,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:31:45,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:45,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732359699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:45,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 15:31:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914665102] [2024-11-09 15:31:45,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:45,202 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:31:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:31:45,203 INFO L87 Difference]: Start difference. First operand 276 states and 417 transitions. cyclomatic complexity: 143 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:45,535 INFO L93 Difference]: Finished difference Result 414 states and 586 transitions. [2024-11-09 15:31:45,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 586 transitions. [2024-11-09 15:31:45,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 329 [2024-11-09 15:31:45,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 414 states and 586 transitions. [2024-11-09 15:31:45,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2024-11-09 15:31:45,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2024-11-09 15:31:45,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 414 states and 586 transitions. [2024-11-09 15:31:45,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:45,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 414 states and 586 transitions. [2024-11-09 15:31:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states and 586 transitions. [2024-11-09 15:31:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 296. [2024-11-09 15:31:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 296 states have (on average 1.4831081081081081) internal successors, (439), 295 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 439 transitions. [2024-11-09 15:31:45,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 296 states and 439 transitions. [2024-11-09 15:31:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:31:45,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 296 states and 439 transitions. [2024-11-09 15:31:45,549 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:31:45,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 439 transitions. [2024-11-09 15:31:45,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 248 [2024-11-09 15:31:45,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:45,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:45,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:45,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:45,551 INFO L745 eck$LassoCheckResult]: Stem: 3255#$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(13, 2); 3226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 3215#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 3217#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 3218#L59-1 mp_add_~nb~0#1 := 4; 3234#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 3224#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3466#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3467#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 3235#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 3236#L84-2 [2024-11-09 15:31:45,552 INFO L747 eck$LassoCheckResult]: Loop: 3236#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3238#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3227#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3228#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 3480#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 3461#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3313#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3295#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3280#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3281#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 3266#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3267#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 3443#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3438#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 3437#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3435#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3432#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 3429#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 3428#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3424#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 3409#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3334#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 3401#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 3400#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3397#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 3391#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 3236#L84-2 [2024-11-09 15:31:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 7 times [2024-11-09 15:31:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:45,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957002409] [2024-11-09 15:31:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:45,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:45,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:45,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1386448425, now seen corresponding path program 1 times [2024-11-09 15:31:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:45,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690109945] [2024-11-09 15:31:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:45,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:31:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690109945] [2024-11-09 15:31:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690109945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:31:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334939831] [2024-11-09 15:31:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:45,662 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:45,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:45,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:31:45,663 INFO L87 Difference]: Start difference. First operand 296 states and 439 transitions. cyclomatic complexity: 145 Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:45,829 INFO L93 Difference]: Finished difference Result 436 states and 627 transitions. [2024-11-09 15:31:45,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 436 states and 627 transitions. [2024-11-09 15:31:45,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 388 [2024-11-09 15:31:45,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 436 states to 436 states and 627 transitions. [2024-11-09 15:31:45,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2024-11-09 15:31:45,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2024-11-09 15:31:45,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 627 transitions. [2024-11-09 15:31:45,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:45,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 436 states and 627 transitions. [2024-11-09 15:31:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 627 transitions. [2024-11-09 15:31:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 352. [2024-11-09 15:31:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 352 states have (on average 1.4744318181818181) internal successors, (519), 351 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 519 transitions. [2024-11-09 15:31:45,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 352 states and 519 transitions. [2024-11-09 15:31:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:31:45,854 INFO L425 stractBuchiCegarLoop]: Abstraction has 352 states and 519 transitions. [2024-11-09 15:31:45,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:31:45,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 352 states and 519 transitions. [2024-11-09 15:31:45,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 304 [2024-11-09 15:31:45,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:45,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:45,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:45,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:45,857 INFO L745 eck$LassoCheckResult]: Stem: 4001#$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(13, 2); 3969#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 3951#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 3953#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 3954#L59-1 mp_add_~nb~0#1 := 4; 3974#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 3965#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4195#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4182#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 4183#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 4088#L84-2 [2024-11-09 15:31:45,857 INFO L747 eck$LassoCheckResult]: Loop: 4088#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4192#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4190#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4191#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 4180#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 4181#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4086#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4087#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4068#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4069#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 4034#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4035#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 4302#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 4301#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 4176#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4100#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4048#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4027#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4028#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 4053#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4203#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 4177#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 4284#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 4282#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4091#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4070#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4064#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4063#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 4062#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4058#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 4059#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 4088#L84-2 [2024-11-09 15:31:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 8 times [2024-11-09 15:31:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:45,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818694563] [2024-11-09 15:31:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:45,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:45,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash -980790750, now seen corresponding path program 1 times [2024-11-09 15:31:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929402355] [2024-11-09 15:31:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:46,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929402355] [2024-11-09 15:31:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929402355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122695297] [2024-11-09 15:31:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:46,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:46,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 15:31:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:46,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:31:46,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 15:31:46,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122695297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 15:31:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420723440] [2024-11-09 15:31:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:46,123 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:31:46,123 INFO L87 Difference]: Start difference. First operand 352 states and 519 transitions. cyclomatic complexity: 169 Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:46,279 INFO L93 Difference]: Finished difference Result 365 states and 486 transitions. [2024-11-09 15:31:46,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 486 transitions. [2024-11-09 15:31:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 317 [2024-11-09 15:31:46,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 486 transitions. [2024-11-09 15:31:46,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2024-11-09 15:31:46,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2024-11-09 15:31:46,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 486 transitions. [2024-11-09 15:31:46,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:46,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 365 states and 486 transitions. [2024-11-09 15:31:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 486 transitions. [2024-11-09 15:31:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 318. [2024-11-09 15:31:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.3584905660377358) internal successors, (432), 317 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 432 transitions. [2024-11-09 15:31:46,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 432 transitions. [2024-11-09 15:31:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:46,290 INFO L425 stractBuchiCegarLoop]: Abstraction has 318 states and 432 transitions. [2024-11-09 15:31:46,291 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:31:46,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 432 transitions. [2024-11-09 15:31:46,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 270 [2024-11-09 15:31:46,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:46,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:46,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:46,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:46,293 INFO L745 eck$LassoCheckResult]: Stem: 4816#$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(13, 2); 4784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 4773#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 4775#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 4776#L59-1 mp_add_~nb~0#1 := 4; 4791#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 4782#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4937#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4936#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 4934#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 4894#L84-2 [2024-11-09 15:31:46,294 INFO L747 eck$LassoCheckResult]: Loop: 4894#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4935#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4932#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4933#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 4983#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 4982#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4883#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4884#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4873#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4874#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 4845#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4846#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 5019#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 5016#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 4896#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5065#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4853#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5063#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5059#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 5058#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4906#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 4907#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 4990#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 4988#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4925#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4927#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4919#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 4910#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 4909#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4897#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 4893#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 4894#L84-2 [2024-11-09 15:31:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 9 times [2024-11-09 15:31:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376297873] [2024-11-09 15:31:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:46,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:46,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -923532448, now seen corresponding path program 2 times [2024-11-09 15:31:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128084930] [2024-11-09 15:31:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128084930] [2024-11-09 15:31:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128084930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245570516] [2024-11-09 15:31:46,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:31:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:46,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:46,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 15:31:46,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:31:46,500 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:46,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:31:46,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:31:46,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:31:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245570516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:46,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-09 15:31:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000516071] [2024-11-09 15:31:46,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:46,621 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:31:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:31:46,622 INFO L87 Difference]: Start difference. First operand 318 states and 432 transitions. cyclomatic complexity: 116 Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:48,003 INFO L93 Difference]: Finished difference Result 545 states and 670 transitions. [2024-11-09 15:31:48,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 545 states and 670 transitions. [2024-11-09 15:31:48,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 481 [2024-11-09 15:31:48,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 545 states to 545 states and 670 transitions. [2024-11-09 15:31:48,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 545 [2024-11-09 15:31:48,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2024-11-09 15:31:48,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 545 states and 670 transitions. [2024-11-09 15:31:48,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:48,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 545 states and 670 transitions. [2024-11-09 15:31:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states and 670 transitions. [2024-11-09 15:31:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 344. [2024-11-09 15:31:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 1.2761627906976745) internal successors, (439), 343 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 439 transitions. [2024-11-09 15:31:48,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 344 states and 439 transitions. [2024-11-09 15:31:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 15:31:48,020 INFO L425 stractBuchiCegarLoop]: Abstraction has 344 states and 439 transitions. [2024-11-09 15:31:48,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:31:48,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 439 transitions. [2024-11-09 15:31:48,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 287 [2024-11-09 15:31:48,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:48,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:48,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,023 INFO L745 eck$LassoCheckResult]: Stem: 5975#$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(13, 2); 5944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 5929#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 5931#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 5932#L59-1 mp_add_~nb~0#1 := 4; 5952#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 5940#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6085#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6083#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 6082#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 6081#L84-2 [2024-11-09 15:31:48,023 INFO L747 eck$LassoCheckResult]: Loop: 6081#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6080#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6079#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6077#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6073#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 6071#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6069#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6067#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6045#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6037#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6038#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6215#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 5953#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5954#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 6053#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6257#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6255#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6251#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 6245#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6137#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6136#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6134#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6132#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6130#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6128#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 6129#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6158#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 6119#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6150#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6148#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6143#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5988#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 5989#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6108#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 6103#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 6100#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6102#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6101#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6097#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 6098#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 6260#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6259#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6253#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6194#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6190#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6189#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6186#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 6179#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6176#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 6174#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6171#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6172#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5943#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 5962#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6043#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6063#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 6084#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 6065#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6066#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6055#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6057#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6139#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 6138#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6035#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6032#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6031#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6030#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6029#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6027#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 6025#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 6021#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 6019#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6015#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6013#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6010#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 6006#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 6003#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6004#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 6058#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 6081#L84-2 [2024-11-09 15:31:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 10 times [2024-11-09 15:31:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679000365] [2024-11-09 15:31:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:48,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:48,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1833974370, now seen corresponding path program 1 times [2024-11-09 15:31:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427014191] [2024-11-09 15:31:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 131 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 15:31:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427014191] [2024-11-09 15:31:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427014191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388052651] [2024-11-09 15:31:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:48,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:48,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 15:31:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:48,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:31:48,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 15:31:48,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388052651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:48,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:48,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-09 15:31:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870460138] [2024-11-09 15:31:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:48,348 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:31:48,349 INFO L87 Difference]: Start difference. First operand 344 states and 439 transitions. cyclomatic complexity: 97 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:48,420 INFO L93 Difference]: Finished difference Result 605 states and 748 transitions. [2024-11-09 15:31:48,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 748 transitions. [2024-11-09 15:31:48,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 521 [2024-11-09 15:31:48,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 597 states and 739 transitions. [2024-11-09 15:31:48,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 597 [2024-11-09 15:31:48,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 597 [2024-11-09 15:31:48,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 597 states and 739 transitions. [2024-11-09 15:31:48,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:48,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 597 states and 739 transitions. [2024-11-09 15:31:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states and 739 transitions. [2024-11-09 15:31:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 522. [2024-11-09 15:31:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 522 states have (on average 1.2509578544061302) internal successors, (653), 521 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 653 transitions. [2024-11-09 15:31:48,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 522 states and 653 transitions. [2024-11-09 15:31:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:48,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 522 states and 653 transitions. [2024-11-09 15:31:48,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:31:48,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 653 transitions. [2024-11-09 15:31:48,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 450 [2024-11-09 15:31:48,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:48,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:48,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,439 INFO L745 eck$LassoCheckResult]: Stem: 7167#$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(13, 2); 7138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 7123#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 7125#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 7126#L59-1 mp_add_~nb~0#1 := 4; 7146#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 7134#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7332#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7328#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 7266#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 7259#L84-2 [2024-11-09 15:31:48,439 INFO L747 eck$LassoCheckResult]: Loop: 7259#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7260#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7253#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7254#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 7258#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 7255#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7251#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7252#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7630#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 7627#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7624#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7621#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7620#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7618#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7610#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7608#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 7161#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 7588#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7560#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 7490#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7559#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7557#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 7556#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7555#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 7237#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7554#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7553#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7550#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7551#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 7619#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 7617#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 7483#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7616#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7614#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 7492#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7241#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7242#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7449#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 7448#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 7445#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7447#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7446#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7442#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 7443#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 7495#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7480#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7475#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7471#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 7468#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7467#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7466#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 7465#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 7464#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 7463#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7462#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7460#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7426#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7392#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7393#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7420#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 7419#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7417#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7415#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7414#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7412#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 7411#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 7520#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7517#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7234#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7232#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7229#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7230#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7224#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 7226#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 7220#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 7221#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7214#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7215#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7209#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 7210#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 7196#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7197#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 7323#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 7259#L84-2 [2024-11-09 15:31:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 11 times [2024-11-09 15:31:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585485227] [2024-11-09 15:31:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:48,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:48,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:48,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1604096996, now seen corresponding path program 1 times [2024-11-09 15:31:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343896409] [2024-11-09 15:31:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 15:31:48,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:48,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343896409] [2024-11-09 15:31:48,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343896409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 15:31:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262912864] [2024-11-09 15:31:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:48,625 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:31:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:31:48,626 INFO L87 Difference]: Start difference. First operand 522 states and 653 transitions. cyclomatic complexity: 134 Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:48,945 INFO L93 Difference]: Finished difference Result 824 states and 1019 transitions. [2024-11-09 15:31:48,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 824 states and 1019 transitions. [2024-11-09 15:31:48,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 714 [2024-11-09 15:31:48,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 824 states to 816 states and 1008 transitions. [2024-11-09 15:31:48,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816 [2024-11-09 15:31:48,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816 [2024-11-09 15:31:48,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 816 states and 1008 transitions. [2024-11-09 15:31:48,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:48,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 816 states and 1008 transitions. [2024-11-09 15:31:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states and 1008 transitions. [2024-11-09 15:31:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 734. [2024-11-09 15:31:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 734 states have (on average 1.2547683923705721) internal successors, (921), 733 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 921 transitions. [2024-11-09 15:31:48,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 734 states and 921 transitions. [2024-11-09 15:31:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:31:48,965 INFO L425 stractBuchiCegarLoop]: Abstraction has 734 states and 921 transitions. [2024-11-09 15:31:48,965 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:31:48,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 734 states and 921 transitions. [2024-11-09 15:31:48,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 662 [2024-11-09 15:31:48,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:48,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:48,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:48,969 INFO L745 eck$LassoCheckResult]: Stem: 8543#$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(13, 2); 8511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 8500#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 8502#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 8503#L59-1 mp_add_~nb~0#1 := 4; 8516#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 8541#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 8542#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8892#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 8891#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 8890#L84-2 [2024-11-09 15:31:48,970 INFO L747 eck$LassoCheckResult]: Loop: 8890#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8889#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8888#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8886#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 8885#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 8884#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8883#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8882#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8881#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 8880#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8878#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8876#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8874#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8872#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8869#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8870#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 8802#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 8801#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8800#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 8614#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8794#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8790#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 8785#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8782#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8777#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8775#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8773#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8771#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8762#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 8743#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 8742#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8741#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8740#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 8739#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8737#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 8736#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8735#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8734#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8733#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8732#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8731#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8729#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 8727#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 8726#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 8724#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8722#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8719#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8715#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8710#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8707#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8708#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 8798#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 8797#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8796#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8795#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8792#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8786#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 8784#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8781#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8658#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8656#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8637#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8634#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8635#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 8627#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8625#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8623#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8622#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8619#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 8605#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 8603#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8598#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8600#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8594#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8595#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8649#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8647#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 8645#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 8644#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 8643#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8642#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8640#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8639#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 8638#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 8636#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8630#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 8631#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 8890#L84-2 [2024-11-09 15:31:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 12 times [2024-11-09 15:31:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968857305] [2024-11-09 15:31:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:48,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:49,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -104737462, now seen corresponding path program 1 times [2024-11-09 15:31:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597277235] [2024-11-09 15:31:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 139 proven. 41 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 15:31:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597277235] [2024-11-09 15:31:49,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597277235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174001259] [2024-11-09 15:31:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:49,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:49,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:49,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 15:31:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:49,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:31:49,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 169 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:31:49,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 143 proven. 40 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:31:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174001259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:49,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:31:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229392063] [2024-11-09 15:31:49,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:49,698 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:31:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:31:49,699 INFO L87 Difference]: Start difference. First operand 734 states and 921 transitions. cyclomatic complexity: 191 Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:51,097 INFO L93 Difference]: Finished difference Result 2293 states and 2818 transitions. [2024-11-09 15:31:51,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2293 states and 2818 transitions. [2024-11-09 15:31:51,109 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1845 [2024-11-09 15:31:51,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2293 states to 2271 states and 2796 transitions. [2024-11-09 15:31:51,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2271 [2024-11-09 15:31:51,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2271 [2024-11-09 15:31:51,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2271 states and 2796 transitions. [2024-11-09 15:31:51,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:51,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2271 states and 2796 transitions. [2024-11-09 15:31:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states and 2796 transitions. [2024-11-09 15:31:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1568. [2024-11-09 15:31:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1568 states have (on average 1.2633928571428572) internal successors, (1981), 1567 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1981 transitions. [2024-11-09 15:31:51,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1568 states and 1981 transitions. [2024-11-09 15:31:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 15:31:51,150 INFO L425 stractBuchiCegarLoop]: Abstraction has 1568 states and 1981 transitions. [2024-11-09 15:31:51,150 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-09 15:31:51,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1568 states and 1981 transitions. [2024-11-09 15:31:51,156 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1341 [2024-11-09 15:31:51,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:51,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:51,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:51,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:51,159 INFO L745 eck$LassoCheckResult]: Stem: 12167#$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(13, 2); 12139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 12124#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 12126#L61 assume !(0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296)); 12127#L59-1 mp_add_~nb~0#1 := 4; 12144#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 12135#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 12252#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12253#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 12245#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 12246#L84-2 [2024-11-09 15:31:51,159 INFO L747 eck$LassoCheckResult]: Loop: 12246#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13252#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13251#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13250#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 13249#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 13248#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13247#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13246#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13244#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 13243#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 13242#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13241#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13240#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13239#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 13236#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13237#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 13167#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13124#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 13121#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13122#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13111#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 13112#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13098#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 13096#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13097#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13162#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 13163#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12940#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12938#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12936#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12934#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 12931#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12932#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 12895#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12894#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12893#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 12892#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12890#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 12889#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12888#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12887#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 12886#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12884#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 12883#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12882#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12881#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 12880#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12879#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 12878#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12876#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 12877#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13033#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13032#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13030#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 13026#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 13028#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 13130#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13129#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13128#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13103#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 13104#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 13017#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13018#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 12710#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 12711#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 13344#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13342#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13338#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13219#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12777#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 12778#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13156#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 13157#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13152#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13175#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13174#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13172#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 13173#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 13181#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13155#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13154#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13101#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 13102#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 12408#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12409#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 12361#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 12354#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 12355#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12350#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12351#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12345#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 12346#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 12341#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12342#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 12654#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 12246#L84-2 [2024-11-09 15:31:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 959927467, now seen corresponding path program 13 times [2024-11-09 15:31:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104910737] [2024-11-09 15:31:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:51,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:51,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:51,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash 563035476, now seen corresponding path program 1 times [2024-11-09 15:31:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314288017] [2024-11-09 15:31:51,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:51,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 163 proven. 9 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 15:31:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:51,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314288017] [2024-11-09 15:31:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314288017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342198946] [2024-11-09 15:31:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:51,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:51,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:51,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:51,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 15:31:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:51,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:31:51,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 147 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 15:31:51,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 147 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 15:31:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342198946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:51,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2024-11-09 15:31:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263074199] [2024-11-09 15:31:51,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:51,707 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:31:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:31:51,708 INFO L87 Difference]: Start difference. First operand 1568 states and 1981 transitions. cyclomatic complexity: 421 Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:53,863 INFO L93 Difference]: Finished difference Result 2057 states and 2471 transitions. [2024-11-09 15:31:53,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2057 states and 2471 transitions. [2024-11-09 15:31:53,876 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1643 [2024-11-09 15:31:53,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2057 states to 2036 states and 2450 transitions. [2024-11-09 15:31:53,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2036 [2024-11-09 15:31:53,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2036 [2024-11-09 15:31:53,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2036 states and 2450 transitions. [2024-11-09 15:31:53,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:53,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2036 states and 2450 transitions. [2024-11-09 15:31:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states and 2450 transitions. [2024-11-09 15:31:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 903. [2024-11-09 15:31:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 903 states have (on average 1.2081949058693244) internal successors, (1091), 902 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1091 transitions. [2024-11-09 15:31:53,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 903 states and 1091 transitions. [2024-11-09 15:31:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-09 15:31:53,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 903 states and 1091 transitions. [2024-11-09 15:31:53,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-09 15:31:53,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 903 states and 1091 transitions. [2024-11-09 15:31:53,913 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 682 [2024-11-09 15:31:53,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:53,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:53,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:53,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2024-11-09 15:31:53,914 INFO L745 eck$LassoCheckResult]: Stem: 16530#$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(13, 2); 16498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 16487#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 16489#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 16491#L63 assume !(0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296)); 16492#L59-1 mp_add_~nb~0#1 := 4; 16549#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 16546#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 16544#L80-2 assume !(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296)); 16543#L107-1 assume !!((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4); 16541#L108 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := 0; 16542#L108-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16550#L109-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16551#L110-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16555#L111-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 16554#L107-1 assume !!((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4); 16553#L108 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16552#L108-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := 0; 16517#L109-1 [2024-11-09 15:31:53,914 INFO L747 eck$LassoCheckResult]: Loop: 16517#L109-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16509#L110-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16510#L111-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 16560#L107-1 assume !!((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4); 16558#L108 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16536#L108-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16534#L109-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := 0; 16535#L110-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16539#L111-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 16515#L107-1 assume !!((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4); 16516#L108 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16522#L108-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16525#L109-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16568#L110-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := 0; 16501#L111-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 16502#L107-1 assume !!((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < 4); 16537#L108 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 16538#L108-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := 0; 16517#L109-1 [2024-11-09 15:31:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2073809327, now seen corresponding path program 1 times [2024-11-09 15:31:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:53,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747957187] [2024-11-09 15:31:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 15:31:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:53,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747957187] [2024-11-09 15:31:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747957187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830305681] [2024-11-09 15:31:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:53,967 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:53,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -830477736, now seen corresponding path program 1 times [2024-11-09 15:31:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026073502] [2024-11-09 15:31:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:31:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026073502] [2024-11-09 15:31:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026073502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748547105] [2024-11-09 15:31:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:54,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 15:31:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:31:54,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 15:31:54,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748547105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:54,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 15:31:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167076336] [2024-11-09 15:31:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:54,071 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:31:54,072 INFO L87 Difference]: Start difference. First operand 903 states and 1091 transitions. cyclomatic complexity: 197 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:54,182 INFO L93 Difference]: Finished difference Result 1014 states and 1195 transitions. [2024-11-09 15:31:54,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1014 states and 1195 transitions. [2024-11-09 15:31:54,185 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 741 [2024-11-09 15:31:54,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1014 states to 909 states and 1029 transitions. [2024-11-09 15:31:54,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 909 [2024-11-09 15:31:54,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 909 [2024-11-09 15:31:54,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 909 states and 1029 transitions. [2024-11-09 15:31:54,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:54,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 909 states and 1029 transitions. [2024-11-09 15:31:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states and 1029 transitions. [2024-11-09 15:31:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 769. [2024-11-09 15:31:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 769 states have (on average 1.1495448634590377) internal successors, (884), 768 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 884 transitions. [2024-11-09 15:31:54,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 769 states and 884 transitions. [2024-11-09 15:31:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:54,202 INFO L425 stractBuchiCegarLoop]: Abstraction has 769 states and 884 transitions. [2024-11-09 15:31:54,202 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-09 15:31:54,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 769 states and 884 transitions. [2024-11-09 15:31:54,205 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 653 [2024-11-09 15:31:54,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:54,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:54,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:54,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:54,206 INFO L745 eck$LassoCheckResult]: Stem: 18498#$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(13, 2); 18479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 18462#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 18463#L59-1 mp_add_~nb~0#1 := 4; 18484#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 18477#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18522#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18523#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 18519#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 18520#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18515#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18516#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18503#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 18468#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 18469#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18483#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18474#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18475#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18490#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 19204#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19173#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 19154#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19155#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 19115#L85-1 [2024-11-09 15:31:54,206 INFO L747 eck$LassoCheckResult]: Loop: 19115#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19211#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19210#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 19208#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 19205#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19206#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 19199#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19200#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19194#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 19195#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19170#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 18485#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 18486#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19120#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 19112#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19165#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 19164#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 19163#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19162#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19161#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 19160#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19159#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 19156#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19153#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 19152#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19151#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19150#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19149#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 19148#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 19146#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 19144#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19145#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19140#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19141#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 19136#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 19137#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19187#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 19133#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19132#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19130#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19131#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19127#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 19128#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 19124#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19123#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19122#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19121#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19119#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 19118#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19117#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 19116#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 19114#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 19115#L85-1 [2024-11-09 15:31:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash 847980263, now seen corresponding path program 1 times [2024-11-09 15:31:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438925973] [2024-11-09 15:31:54,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438925973] [2024-11-09 15:31:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438925973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:31:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572068339] [2024-11-09 15:31:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:54,343 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:54,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -95611915, now seen corresponding path program 1 times [2024-11-09 15:31:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619275244] [2024-11-09 15:31:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619275244] [2024-11-09 15:31:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619275244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770070580] [2024-11-09 15:31:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:54,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:54,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 15:31:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:54,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 15:31:54,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 15:31:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770070580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:54,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-09 15:31:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134194820] [2024-11-09 15:31:54,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:54,685 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:31:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:31:54,686 INFO L87 Difference]: Start difference. First operand 769 states and 884 transitions. cyclomatic complexity: 123 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:54,783 INFO L93 Difference]: Finished difference Result 1382 states and 1585 transitions. [2024-11-09 15:31:54,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1382 states and 1585 transitions. [2024-11-09 15:31:54,789 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1177 [2024-11-09 15:31:54,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1382 states to 1382 states and 1585 transitions. [2024-11-09 15:31:54,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1382 [2024-11-09 15:31:54,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1382 [2024-11-09 15:31:54,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1382 states and 1585 transitions. [2024-11-09 15:31:54,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:54,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1382 states and 1585 transitions. [2024-11-09 15:31:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states and 1585 transitions. [2024-11-09 15:31:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2024-11-09 15:31:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 788 states have (on average 1.1472081218274113) internal successors, (904), 787 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 904 transitions. [2024-11-09 15:31:54,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 788 states and 904 transitions. [2024-11-09 15:31:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:31:54,809 INFO L425 stractBuchiCegarLoop]: Abstraction has 788 states and 904 transitions. [2024-11-09 15:31:54,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-09 15:31:54,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 788 states and 904 transitions. [2024-11-09 15:31:54,812 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 653 [2024-11-09 15:31:54,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:54,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:54,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:54,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:54,813 INFO L745 eck$LassoCheckResult]: Stem: 20975#$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(13, 2); 20954#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 20943#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 20944#L59-1 mp_add_~nb~0#1 := 4; 20957#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 20960#L71 assume !(0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296)); 20973#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 20974#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21032#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21033#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 21030#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21031#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21028#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21029#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 21027#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 21158#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 21157#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21156#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21155#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21154#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 21153#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21152#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21151#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21150#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 21069#L85-1 [2024-11-09 15:31:54,813 INFO L747 eck$LassoCheckResult]: Loop: 21069#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21149#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21148#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 21146#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 21142#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21143#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 21136#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21137#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21128#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 21129#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21122#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21121#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21120#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21118#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 21117#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21116#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 21115#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 21114#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21113#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21112#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 21111#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21110#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 21109#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21108#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21107#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21106#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21105#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21104#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 21103#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 21102#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 21100#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21098#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21096#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21094#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 21092#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 21090#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21087#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21086#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21085#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21064#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21065#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21084#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 21080#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 21081#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21077#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21076#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21075#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21074#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 21073#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21072#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 21071#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 21068#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 21069#L85-1 [2024-11-09 15:31:54,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1525234442, now seen corresponding path program 1 times [2024-11-09 15:31:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396518889] [2024-11-09 15:31:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:54,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396518889] [2024-11-09 15:31:54,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396518889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:54,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:54,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:31:54,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738187063] [2024-11-09 15:31:54,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:54,882 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -95611915, now seen corresponding path program 2 times [2024-11-09 15:31:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780771219] [2024-11-09 15:31:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780771219] [2024-11-09 15:31:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780771219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285309855] [2024-11-09 15:31:54,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:31:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:54,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:55,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 15:31:55,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:31:55,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:55,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:55,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 15:31:55,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285309855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:55,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-09 15:31:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290436766] [2024-11-09 15:31:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:55,162 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:31:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:31:55,163 INFO L87 Difference]: Start difference. First operand 788 states and 904 transitions. cyclomatic complexity: 124 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:55,324 INFO L93 Difference]: Finished difference Result 1995 states and 2286 transitions. [2024-11-09 15:31:55,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1995 states and 2286 transitions. [2024-11-09 15:31:55,333 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 1701 [2024-11-09 15:31:55,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1995 states to 1995 states and 2286 transitions. [2024-11-09 15:31:55,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1995 [2024-11-09 15:31:55,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1995 [2024-11-09 15:31:55,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1995 states and 2286 transitions. [2024-11-09 15:31:55,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:55,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1995 states and 2286 transitions. [2024-11-09 15:31:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states and 2286 transitions. [2024-11-09 15:31:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 788. [2024-11-09 15:31:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 788 states have (on average 1.1472081218274113) internal successors, (904), 787 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 904 transitions. [2024-11-09 15:31:55,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 788 states and 904 transitions. [2024-11-09 15:31:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:31:55,359 INFO L425 stractBuchiCegarLoop]: Abstraction has 788 states and 904 transitions. [2024-11-09 15:31:55,360 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-09 15:31:55,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 788 states and 904 transitions. [2024-11-09 15:31:55,362 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 653 [2024-11-09 15:31:55,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:55,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:55,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:55,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:55,363 INFO L745 eck$LassoCheckResult]: Stem: 23930#$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(13, 2); 23913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 23896#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 23897#L59-1 mp_add_~nb~0#1 := 4; 24265#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 24264#L71 assume 0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 24262#L73 assume 0 == (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 24263#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 24502#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24499#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24496#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 24494#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24492#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24490#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24488#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 24486#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 24482#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 24483#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24473#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24474#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24469#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 24470#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24465#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24466#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24462#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 24461#L85-1 [2024-11-09 15:31:55,363 INFO L747 eck$LassoCheckResult]: Loop: 24461#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24460#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24457#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 24458#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 24557#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24555#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 24553#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24551#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24549#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 24547#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24544#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24543#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24542#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24541#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 24540#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24539#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 24538#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 24537#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24536#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24535#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 24534#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24533#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 24532#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24531#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24530#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24529#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24528#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24527#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 24526#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 24524#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 24522#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24523#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24518#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24519#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 24514#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 24515#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24511#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24510#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24508#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24506#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24507#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24561#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 24560#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 24559#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24475#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24476#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24471#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24472#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 24467#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24468#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 24463#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 24464#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 24461#L85-1 [2024-11-09 15:31:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -311032260, now seen corresponding path program 1 times [2024-11-09 15:31:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:55,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765979617] [2024-11-09 15:31:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765979617] [2024-11-09 15:31:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765979617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:55,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:55,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 15:31:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009281341] [2024-11-09 15:31:55,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:55,461 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1885531531, now seen corresponding path program 3 times [2024-11-09 15:31:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522286702] [2024-11-09 15:31:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522286702] [2024-11-09 15:31:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522286702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821483786] [2024-11-09 15:31:55,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:31:55,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:55,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:55,578 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:55,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 15:31:55,618 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 15:31:55,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:55,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:55,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 15:31:55,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821483786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:55,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:55,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-09 15:31:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509970348] [2024-11-09 15:31:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:55,710 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:31:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:31:55,711 INFO L87 Difference]: Start difference. First operand 788 states and 904 transitions. cyclomatic complexity: 124 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:56,090 INFO L93 Difference]: Finished difference Result 2469 states and 2833 transitions. [2024-11-09 15:31:56,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2469 states and 2833 transitions. [2024-11-09 15:31:56,100 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 2096 [2024-11-09 15:31:56,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2469 states to 2469 states and 2833 transitions. [2024-11-09 15:31:56,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2469 [2024-11-09 15:31:56,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2469 [2024-11-09 15:31:56,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2469 states and 2833 transitions. [2024-11-09 15:31:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:56,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2469 states and 2833 transitions. [2024-11-09 15:31:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states and 2833 transitions. [2024-11-09 15:31:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 630. [2024-11-09 15:31:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 630 states have (on average 1.1587301587301588) internal successors, (730), 629 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 730 transitions. [2024-11-09 15:31:56,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 630 states and 730 transitions. [2024-11-09 15:31:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:31:56,137 INFO L425 stractBuchiCegarLoop]: Abstraction has 630 states and 730 transitions. [2024-11-09 15:31:56,137 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-09 15:31:56,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 730 transitions. [2024-11-09 15:31:56,139 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 524 [2024-11-09 15:31:56,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:56,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:56,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:56,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:56,141 INFO L745 eck$LassoCheckResult]: Stem: 27369#$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(13, 2); 27350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 27333#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 27335#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 27337#L63 assume !(0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296)); 27338#L59-1 mp_add_~nb~0#1 := 4; 27913#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 27910#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 27909#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27908#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27907#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 27906#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 27905#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27904#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27903#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27902#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 27901#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 27899#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27897#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27895#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27893#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 27891#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27889#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27887#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 27885#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27882#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 27862#L91-1 [2024-11-09 15:31:56,141 INFO L747 eck$LassoCheckResult]: Loop: 27862#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27942#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27959#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 27957#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27955#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 27953#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27952#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27365#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 27358#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27359#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27366#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 27363#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27364#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27941#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 27341#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27342#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 27344#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27354#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27348#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 27349#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27951#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 27939#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27940#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27936#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 27935#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27934#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27933#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27932#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 27930#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 27929#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27928#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27927#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27926#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 27925#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 27924#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27923#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27921#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 27922#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 27962#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27900#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27898#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27896#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27894#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 27892#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27890#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 27888#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 27886#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 27883#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 27862#L91-1 [2024-11-09 15:31:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2064453638, now seen corresponding path program 1 times [2024-11-09 15:31:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150881523] [2024-11-09 15:31:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 15:31:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150881523] [2024-11-09 15:31:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150881523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 15:31:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366947320] [2024-11-09 15:31:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:56,269 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:56,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -959575817, now seen corresponding path program 1 times [2024-11-09 15:31:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123639930] [2024-11-09 15:31:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:31:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123639930] [2024-11-09 15:31:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123639930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907965316] [2024-11-09 15:31:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:56,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:56,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 15:31:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:56,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:56,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:31:56,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:31:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907965316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:56,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 15:31:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854034753] [2024-11-09 15:31:56,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:56,615 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:31:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:31:56,616 INFO L87 Difference]: Start difference. First operand 630 states and 730 transitions. cyclomatic complexity: 106 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:56,904 INFO L93 Difference]: Finished difference Result 2349 states and 2706 transitions. [2024-11-09 15:31:56,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2349 states and 2706 transitions. [2024-11-09 15:31:56,911 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 2096 [2024-11-09 15:31:56,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2349 states to 2349 states and 2706 transitions. [2024-11-09 15:31:56,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2349 [2024-11-09 15:31:56,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2349 [2024-11-09 15:31:56,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2349 states and 2706 transitions. [2024-11-09 15:31:56,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:56,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2349 states and 2706 transitions. [2024-11-09 15:31:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states and 2706 transitions. [2024-11-09 15:31:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 630. [2024-11-09 15:31:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 630 states have (on average 1.1587301587301588) internal successors, (730), 629 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 730 transitions. [2024-11-09 15:31:56,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 630 states and 730 transitions. [2024-11-09 15:31:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:31:56,943 INFO L425 stractBuchiCegarLoop]: Abstraction has 630 states and 730 transitions. [2024-11-09 15:31:56,943 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-09 15:31:56,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 730 transitions. [2024-11-09 15:31:56,945 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 524 [2024-11-09 15:31:56,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:56,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:56,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:56,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:56,945 INFO L745 eck$LassoCheckResult]: Stem: 30658#$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(13, 2); 30638#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 30627#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 30629#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 30631#L63 assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 30632#L59-1 mp_add_~nb~0#1 := 4; 31222#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 31219#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31218#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31217#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 31216#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 31215#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 31214#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31213#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31212#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31211#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 31210#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31209#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31208#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31207#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31206#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 31205#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30653#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 30654#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 30651#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 30652#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 30625#L91-1 [2024-11-09 15:31:56,947 INFO L747 eck$LassoCheckResult]: Loop: 30625#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 30626#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 30621#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 30622#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 30659#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 31166#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31164#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31162#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 31160#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31158#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 31156#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 31154#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31152#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31149#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 30623#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 30624#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 31227#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31226#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31225#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 31224#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31223#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 30647#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30648#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 31203#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 31201#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31199#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31198#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31196#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 31193#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 31191#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31189#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31187#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31185#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31183#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 31182#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31180#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 31176#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 31174#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 31171#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31169#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31167#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31165#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31163#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 31161#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31159#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 31157#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 31155#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 31153#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 30625#L91-1 [2024-11-09 15:31:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2011658940, now seen corresponding path program 1 times [2024-11-09 15:31:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445593567] [2024-11-09 15:31:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 15:31:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445593567] [2024-11-09 15:31:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445593567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:57,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:31:57,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 15:31:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681022888] [2024-11-09 15:31:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:57,050 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:57,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:57,050 INFO L85 PathProgramCache]: Analyzing trace with hash -959575817, now seen corresponding path program 2 times [2024-11-09 15:31:57,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:57,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819989279] [2024-11-09 15:31:57,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:57,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:31:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819989279] [2024-11-09 15:31:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819989279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453291216] [2024-11-09 15:31:57,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:31:57,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:57,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:57,145 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 15:31:57,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:31:57,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:57,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:57,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 15:31:57,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:31:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453291216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:31:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:31:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-09 15:31:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585839696] [2024-11-09 15:31:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:31:57,285 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:31:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:31:57,285 INFO L87 Difference]: Start difference. First operand 630 states and 730 transitions. cyclomatic complexity: 106 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:57,597 INFO L93 Difference]: Finished difference Result 2336 states and 2691 transitions. [2024-11-09 15:31:57,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2336 states and 2691 transitions. [2024-11-09 15:31:57,604 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 2096 [2024-11-09 15:31:57,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2336 states to 2336 states and 2691 transitions. [2024-11-09 15:31:57,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2336 [2024-11-09 15:31:57,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2336 [2024-11-09 15:31:57,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2336 states and 2691 transitions. [2024-11-09 15:31:57,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:57,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2336 states and 2691 transitions. [2024-11-09 15:31:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states and 2691 transitions. [2024-11-09 15:31:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 610. [2024-11-09 15:31:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 610 states have (on average 1.1557377049180328) internal successors, (705), 609 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 705 transitions. [2024-11-09 15:31:57,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 610 states and 705 transitions. [2024-11-09 15:31:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:31:57,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 610 states and 705 transitions. [2024-11-09 15:31:57,635 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-09 15:31:57,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 705 transitions. [2024-11-09 15:31:57,636 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 524 [2024-11-09 15:31:57,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:57,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:57,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:57,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:57,637 INFO L745 eck$LassoCheckResult]: Stem: 33786#$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(13, 2); 33770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 33760#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 33761#L59-1 mp_add_~nb~0#1 := 4; 34345#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 34342#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34341#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34340#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 34339#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 34338#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34337#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34336#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34335#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 34334#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 34333#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34332#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34331#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 34330#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 33805#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33804#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33803#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33802#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33801#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 33799#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33800#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 33797#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33793#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 33794#L85-1 [2024-11-09 15:31:57,638 INFO L747 eck$LassoCheckResult]: Loop: 33794#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33940#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33938#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 33937#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33936#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 33921#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33935#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33933#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 33929#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33930#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 33911#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33912#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33907#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 33908#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33904#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 33903#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33902#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33900#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 33899#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33897#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 33896#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33895#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33894#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 33893#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33891#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 33890#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33889#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33888#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33886#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33887#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 33883#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33881#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 33880#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33879#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33878#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33876#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 33873#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 33869#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 33868#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33867#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33865#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33866#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33974#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 33973#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33972#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 33845#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33841#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33842#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33949#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33948#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 33944#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 34147#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33926#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33858#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33859#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33854#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 33855#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33850#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 33851#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 33843#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 33794#L85-1 [2024-11-09 15:31:57,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1546560413, now seen corresponding path program 1 times [2024-11-09 15:31:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456210746] [2024-11-09 15:31:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:57,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:57,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 370312889, now seen corresponding path program 1 times [2024-11-09 15:31:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399948264] [2024-11-09 15:31:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399948264] [2024-11-09 15:31:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399948264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400530939] [2024-11-09 15:31:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:57,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:57,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:57,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:57,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 15:31:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:57,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:57,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 15:31:57,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 15:31:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400530939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:57,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-09 15:31:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264468167] [2024-11-09 15:31:57,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:57,974 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:31:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:31:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:31:57,975 INFO L87 Difference]: Start difference. First operand 610 states and 705 transitions. cyclomatic complexity: 101 Second operand has 13 states, 12 states have (on average 10.75) internal successors, (129), 13 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:58,290 INFO L93 Difference]: Finished difference Result 576 states and 630 transitions. [2024-11-09 15:31:58,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 630 transitions. [2024-11-09 15:31:58,292 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 76 [2024-11-09 15:31:58,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 532 states and 584 transitions. [2024-11-09 15:31:58,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2024-11-09 15:31:58,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2024-11-09 15:31:58,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 584 transitions. [2024-11-09 15:31:58,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:31:58,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 532 states and 584 transitions. [2024-11-09 15:31:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 584 transitions. [2024-11-09 15:31:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 242. [2024-11-09 15:31:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.1322314049586777) internal successors, (274), 241 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:31:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 274 transitions. [2024-11-09 15:31:58,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 274 transitions. [2024-11-09 15:31:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:31:58,305 INFO L425 stractBuchiCegarLoop]: Abstraction has 242 states and 274 transitions. [2024-11-09 15:31:58,305 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-09 15:31:58,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 274 transitions. [2024-11-09 15:31:58,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2024-11-09 15:31:58,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:58,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:58,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:58,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:58,308 INFO L745 eck$LassoCheckResult]: Stem: 35352#$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(13, 2); 35336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 35326#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 35327#L59-1 mp_add_~nb~0#1 := 4; 35339#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 35334#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35391#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35392#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 35387#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 35388#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35383#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35384#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35379#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 35380#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 35375#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35376#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35371#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35372#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 35370#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35365#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35366#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35361#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35362#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 35357#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35358#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 35510#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 35509#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35507#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 35508#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35526#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35525#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 35524#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35523#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35522#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35521#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35520#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 35519#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35518#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 35402#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 35517#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35516#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35514#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 35515#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35549#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 35547#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35545#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35543#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35541#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35539#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 35537#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35535#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 35533#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 35534#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 35560#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35563#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35562#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35561#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35346#L102-1 [2024-11-09 15:31:58,308 INFO L747 eck$LassoCheckResult]: Loop: 35346#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 35343#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35344#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 35349#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 35347#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35348#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35324#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35325#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35322#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 35323#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35340#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35331#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35332#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 35346#L102-1 [2024-11-09 15:31:58,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1393305669, now seen corresponding path program 1 times [2024-11-09 15:31:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:58,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105347495] [2024-11-09 15:31:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 15:31:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105347495] [2024-11-09 15:31:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105347495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370257070] [2024-11-09 15:31:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:58,478 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:58,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 15:31:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:58,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:31:58,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 15:31:58,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 15:31:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370257070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:58,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 13 [2024-11-09 15:31:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107410127] [2024-11-09 15:31:58,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:58,839 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 1 times [2024-11-09 15:31:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417324577] [2024-11-09 15:31:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:58,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:58,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:58,941 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:58,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:58,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:58,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:58,942 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:31:58,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:58,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:58,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:58,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration24_Loop [2024-11-09 15:31:58,943 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:58,943 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:58,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:58,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:59,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:31:59,196 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:31:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:59,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:31:59,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:31:59,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:31:59,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:31:59,235 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:31:59,235 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:31:59,251 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-11-09 15:31:59,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:59,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:31:59,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:31:59,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:31:59,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:31:59,334 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-11-09 15:31:59,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:59,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:59,336 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:31:59,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:31:59,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:31:59,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:31:59,794 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:31:59,801 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-11-09 15:31:59,801 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:59,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:59,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:59,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:59,802 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:31:59,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:59,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:59,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:59,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration24_Loop [2024-11-09 15:31:59,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:59,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:59,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:59,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:00,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:00,071 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,074 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:32:00,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:00,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:00,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:32:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,120 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:32:00,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:00,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:00,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:32:00,160 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,162 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:32:00,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,178 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:00,185 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:00,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:32:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,209 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:32:00,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,225 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:00,231 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:00,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:32:00,251 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:00,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,253 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:32:00,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,269 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,275 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:32:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,302 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:32:00,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,318 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,320 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,340 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,342 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:32:00,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,358 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:00,363 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:00,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:32:00,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,393 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:32:00,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:00,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,409 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:00,412 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:00,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:32:00,434 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,436 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:32:00,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,451 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,452 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:00,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,452 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:00,456 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:00,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:32:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,482 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:32:00,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,500 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,500 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:00,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,501 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:00,503 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:00,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:32:00,524 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:00,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,526 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:32:00,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,541 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,542 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:00,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,542 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,549 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,579 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:32:00,595 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,595 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:00,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,596 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,600 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,623 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-11-09 15:32:00,623 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,626 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:32:00,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,641 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,641 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:00,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,642 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:00,651 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:00,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,683 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:32:00,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,698 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,699 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:00,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,699 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:00,703 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:00,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,728 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:00,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,730 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:32:00,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,746 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,747 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:00,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,747 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,754 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,779 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:32:00,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,794 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,794 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:00,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,795 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:00,797 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:00,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,817 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,819 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:32:00,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,835 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,835 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:00,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,835 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:00,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:00,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:00,874 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:00,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:32:00,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:00,890 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:00,890 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:00,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:00,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:00,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:00,890 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:00,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:00,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:00,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:00,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-09 15:32:00,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:00,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:32:00,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:32:00,918 INFO L87 Difference]: Start difference. First operand 242 states and 274 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:01,530 INFO L93 Difference]: Finished difference Result 883 states and 966 transitions. [2024-11-09 15:32:01,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 966 transitions. [2024-11-09 15:32:01,533 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 209 [2024-11-09 15:32:01,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 816 states and 895 transitions. [2024-11-09 15:32:01,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816 [2024-11-09 15:32:01,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816 [2024-11-09 15:32:01,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 816 states and 895 transitions. [2024-11-09 15:32:01,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:01,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 816 states and 895 transitions. [2024-11-09 15:32:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states and 895 transitions. [2024-11-09 15:32:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 385. [2024-11-09 15:32:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 385 states have (on average 1.1168831168831168) internal successors, (430), 384 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 430 transitions. [2024-11-09 15:32:01,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 385 states and 430 transitions. [2024-11-09 15:32:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 15:32:01,547 INFO L425 stractBuchiCegarLoop]: Abstraction has 385 states and 430 transitions. [2024-11-09 15:32:01,547 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-09 15:32:01,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 430 transitions. [2024-11-09 15:32:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2024-11-09 15:32:01,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:01,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:01,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:01,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:01,552 INFO L745 eck$LassoCheckResult]: Stem: 36859#$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(13, 2); 36841#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 36825#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 36827#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 36829#L63 assume !(0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296)); 36830#L59-1 mp_add_~nb~0#1 := 4; 36890#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 36887#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 36886#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36885#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 36884#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 36883#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36882#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36881#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36880#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 36879#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 36878#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36877#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36876#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36875#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 36874#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 36873#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36872#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36871#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36870#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 36869#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36866#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 36868#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 37032#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36860#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 36861#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37175#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37174#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 37173#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37172#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 37171#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37170#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37169#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 37168#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37167#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 36974#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 37166#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37165#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37164#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 37163#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37161#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 37159#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37157#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37152#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 37151#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37148#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 37147#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37145#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 37142#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 37140#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 37139#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37134#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37135#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37130#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37129#L102-1 [2024-11-09 15:32:01,553 INFO L747 eck$LassoCheckResult]: Loop: 37129#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 37127#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37128#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 36927#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 36854#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36855#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36831#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36832#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 36833#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 37178#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37177#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37176#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37131#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 37129#L102-1 [2024-11-09 15:32:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1600719674, now seen corresponding path program 1 times [2024-11-09 15:32:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583497592] [2024-11-09 15:32:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 15:32:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583497592] [2024-11-09 15:32:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583497592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259156170] [2024-11-09 15:32:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:01,704 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:01,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-09 15:32:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:01,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:32:01,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:32:01,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:32:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259156170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:01,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:01,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 12 [2024-11-09 15:32:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062869856] [2024-11-09 15:32:01,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:01,970 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:32:01,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 2 times [2024-11-09 15:32:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:01,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535733239] [2024-11-09 15:32:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:01,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:01,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:02,060 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:02,061 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:02,061 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:02,061 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:02,061 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:02,061 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:02,061 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:02,061 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:02,061 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2024-11-09 15:32:02,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:02,062 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:02,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:02,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:02,321 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:02,324 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:02,326 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:02,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:32:02,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:02,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:02,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:02,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:02,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:02,390 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:02,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:32:02,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:02,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:02,799 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:02,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:02,806 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:02,806 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:02,806 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:02,806 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:02,806 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:02,806 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:02,806 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:02,806 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:02,806 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2024-11-09 15:32:02,806 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:02,806 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:02,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:02,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:03,054 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:03,054 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:03,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,057 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:32:03,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:03,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:03,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,095 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:32:03,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:03,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:03,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,129 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,131 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:32:03,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,147 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:03,151 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:03,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,173 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:32:03,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,190 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:03,192 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:03,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,212 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,214 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:32:03,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,231 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,235 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,260 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:32:03,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,275 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,277 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,296 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:03,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,298 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:32:03,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,315 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:03,321 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:03,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,346 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:32:03,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:03,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,363 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:03,366 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:03,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,381 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,383 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:32:03,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,395 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,395 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:03,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,395 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:03,398 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:03,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:32:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,419 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:32:03,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,431 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,431 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:03,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,431 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:03,433 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:03,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:32:03,448 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,449 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:32:03,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,461 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,462 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:03,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,462 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,466 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,487 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:32:03,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,499 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,499 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:03,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,499 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,502 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,519 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:03,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,521 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-09 15:32:03,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,533 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,533 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:03,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,534 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:03,541 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:03,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-09 15:32:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,566 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:32:03,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,578 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,578 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:03,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,579 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:03,582 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:03,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-09 15:32:03,600 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,602 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:32:03,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,614 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,615 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:03,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,615 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,619 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-09 15:32:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,638 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-09 15:32:03,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,651 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,652 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:03,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,652 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:03,654 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:03,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,668 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,669 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-09 15:32:03,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,681 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,682 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:03,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,682 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:03,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:03,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:03,709 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:03,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-09 15:32:03,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:03,723 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:03,723 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:03,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:03,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:03,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:03,724 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:03,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:03,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:03,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:03,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:03,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:32:03,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:32:03,744 INFO L87 Difference]: Start difference. First operand 385 states and 430 transitions. cyclomatic complexity: 49 Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:05,024 INFO L93 Difference]: Finished difference Result 1324 states and 1441 transitions. [2024-11-09 15:32:05,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 1441 transitions. [2024-11-09 15:32:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 196 [2024-11-09 15:32:05,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1086 states and 1180 transitions. [2024-11-09 15:32:05,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1086 [2024-11-09 15:32:05,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1086 [2024-11-09 15:32:05,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1180 transitions. [2024-11-09 15:32:05,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:05,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1086 states and 1180 transitions. [2024-11-09 15:32:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1180 transitions. [2024-11-09 15:32:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 527. [2024-11-09 15:32:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 527 states have (on average 1.110056925996205) internal successors, (585), 526 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 585 transitions. [2024-11-09 15:32:05,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 527 states and 585 transitions. [2024-11-09 15:32:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 15:32:05,045 INFO L425 stractBuchiCegarLoop]: Abstraction has 527 states and 585 transitions. [2024-11-09 15:32:05,045 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-09 15:32:05,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 527 states and 585 transitions. [2024-11-09 15:32:05,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2024-11-09 15:32:05,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:05,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:05,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:05,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:05,048 INFO L745 eck$LassoCheckResult]: Stem: 39014#$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(13, 2); 38997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 38985#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 38987#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 38989#L63 assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 38990#L59-1 mp_add_~nb~0#1 := 4; 39356#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 39109#L71 assume !(0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296)); 39108#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39103#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39104#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 39099#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 39100#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39095#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39096#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39091#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 39092#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 39087#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39088#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39083#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39084#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 39079#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39080#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39075#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39076#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39071#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 39072#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39066#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 39068#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 39375#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39376#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 39371#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39372#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39367#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 39368#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39454#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39453#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39452#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39360#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 39361#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39320#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 38999#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 39315#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39313#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39314#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 39441#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39439#L89 assume (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254;mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) % 256;mp_add_~carry~0#1 := 1; 39438#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39437#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39436#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39435#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39434#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 39433#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39432#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 39430#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 39431#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 39497#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39507#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39506#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39505#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39009#L102-1 [2024-11-09 15:32:05,048 INFO L747 eck$LassoCheckResult]: Loop: 39009#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 39005#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39006#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 39012#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 39010#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39011#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 38984#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 38981#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 38982#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 38983#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39001#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 38992#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 38993#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 39009#L102-1 [2024-11-09 15:32:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1102177341, now seen corresponding path program 1 times [2024-11-09 15:32:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745292754] [2024-11-09 15:32:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:05,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:05,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 3 times [2024-11-09 15:32:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384731734] [2024-11-09 15:32:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:05,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:05,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -201701748, now seen corresponding path program 2 times [2024-11-09 15:32:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102239924] [2024-11-09 15:32:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:05,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:32:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102239924] [2024-11-09 15:32:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102239924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 15:32:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918849527] [2024-11-09 15:32:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:05,337 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:05,337 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:05,337 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:05,337 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:05,337 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:05,337 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:05,337 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:05,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:05,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2024-11-09 15:32:05,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:05,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:05,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:05,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:05,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:05,550 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:05,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:05,553 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:05,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-09 15:32:05,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:05,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:05,580 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:32:05,580 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:32:05,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:05,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:05,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:05,597 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:05,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-09 15:32:05,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:05,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:05,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-09 15:32:05,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:05,666 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:05,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-09 15:32:05,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:05,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:06,510 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:06,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-09 15:32:06,516 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:06,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:06,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:06,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:06,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:06,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:06,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:06,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2024-11-09 15:32:06,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:06,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:06,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:06,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:06,713 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:06,713 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:06,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,714 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-09 15:32:06,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:06,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:06,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-09 15:32:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,740 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-09 15:32:06,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:06,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:06,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-09 15:32:06,767 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,768 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-09 15:32:06,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,780 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:06,782 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:06,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-09 15:32:06,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,797 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-09 15:32:06,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,810 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:06,813 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:06,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-09 15:32:06,829 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:06,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,830 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-09 15:32:06,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,842 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:06,844 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:06,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-09 15:32:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,859 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-09 15:32:06,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,871 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:06,874 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:06,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:06,890 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,891 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-09 15:32:06,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,903 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:06,905 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:06,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,921 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-09 15:32:06,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:06,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,933 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:06,938 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:06,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-09 15:32:06,953 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,955 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-09 15:32:06,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:06,967 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:06,967 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:06,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:06,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:06,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:06,967 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:06,969 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:06,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:06,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:06,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:06,988 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:06,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-09 15:32:06,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,002 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,002 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:07,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,002 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:07,005 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:07,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:07,022 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:07,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,023 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-09 15:32:07,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,034 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,035 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:07,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,035 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:07,037 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:07,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-09 15:32:07,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,053 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-09 15:32:07,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,065 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,065 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:07,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,066 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:07,070 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:07,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:07,098 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:07,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,122 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-09 15:32:07,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,138 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,138 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:07,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,138 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:07,142 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:07,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-09 15:32:07,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,168 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-09 15:32:07,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,184 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,184 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:07,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,185 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:07,192 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:07,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:07,223 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,225 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-09 15:32:07,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,240 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,241 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:07,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,241 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:07,243 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:07,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:07,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,263 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-09 15:32:07,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,278 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,278 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:07,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,278 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:07,282 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:07,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-09 15:32:07,305 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,307 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-09 15:32:07,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,319 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,319 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:07,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,319 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:07,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:07,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,340 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-09 15:32:07,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:07,351 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:07,351 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:07,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:07,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:07,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:07,351 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:07,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:07,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:07,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:07,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-09 15:32:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:32:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:32:07,379 INFO L87 Difference]: Start difference. First operand 527 states and 585 transitions. cyclomatic complexity: 62 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:07,573 INFO L93 Difference]: Finished difference Result 598 states and 659 transitions. [2024-11-09 15:32:07,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 598 states and 659 transitions. [2024-11-09 15:32:07,574 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2024-11-09 15:32:07,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 598 states to 577 states and 635 transitions. [2024-11-09 15:32:07,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2024-11-09 15:32:07,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2024-11-09 15:32:07,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 635 transitions. [2024-11-09 15:32:07,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:07,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 577 states and 635 transitions. [2024-11-09 15:32:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 635 transitions. [2024-11-09 15:32:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 451. [2024-11-09 15:32:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 451 states have (on average 1.1130820399113082) internal successors, (502), 450 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 502 transitions. [2024-11-09 15:32:07,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 451 states and 502 transitions. [2024-11-09 15:32:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:32:07,584 INFO L425 stractBuchiCegarLoop]: Abstraction has 451 states and 502 transitions. [2024-11-09 15:32:07,584 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-09 15:32:07,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 451 states and 502 transitions. [2024-11-09 15:32:07,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2024-11-09 15:32:07,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:07,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:07,586 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-09 15:32:07,586 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:07,586 INFO L745 eck$LassoCheckResult]: Stem: 40172#$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(13, 2); 40150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 40138#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 40139#L59-1 mp_add_~nb~0#1 := 4; 40153#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 40147#L71 assume !(0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296)); 40148#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 40321#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40317#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 40318#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 40309#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40310#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40301#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40302#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 40293#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 40294#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40285#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40286#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40277#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 40278#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 40269#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40270#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40261#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40262#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 40253#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40254#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 40245#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40246#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 40237#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40238#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40228#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 40230#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 40516#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40513#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 40510#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40507#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40504#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 40500#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40498#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 40157#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40158#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40169#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 40492#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40491#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 40428#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 40490#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40489#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40488#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 40487#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40486#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 40485#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40484#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 40483#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40482#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40481#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40480#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 40175#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 40176#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 40550#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40549#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40548#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40542#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 40541#L102-1 [2024-11-09 15:32:07,587 INFO L747 eck$LassoCheckResult]: Loop: 40541#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 40159#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40160#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 40168#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40495#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40161#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40151#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40152#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 40547#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 40546#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40545#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40544#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40543#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 40541#L102-1 [2024-11-09 15:32:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash 685993656, now seen corresponding path program 1 times [2024-11-09 15:32:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:07,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672863804] [2024-11-09 15:32:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 15:32:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672863804] [2024-11-09 15:32:07,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672863804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564751193] [2024-11-09 15:32:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:07,711 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:07,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-09 15:32:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:07,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:32:07,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 15:32:07,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 15:32:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564751193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:07,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-11-09 15:32:07,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867939969] [2024-11-09 15:32:07,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:07,985 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:32:07,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 1 times [2024-11-09 15:32:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749370021] [2024-11-09 15:32:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:07,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:07,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:08,078 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:08,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:08,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:08,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:08,079 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:08,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:08,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:08,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:08,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2024-11-09 15:32:08,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:08,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:08,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:08,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:08,306 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:08,306 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:08,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:08,307 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:08,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-09 15:32:08,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:08,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:08,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-09 15:32:08,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:08,350 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-09 15:32:08,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:08,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:08,740 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:08,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-09 15:32:08,747 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:08,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:08,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:08,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:08,747 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:08,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:08,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:08,747 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:08,747 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2024-11-09 15:32:08,747 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:08,747 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:08,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:08,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:08,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:08,979 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:08,980 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-09 15:32:08,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:08,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:08,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:08,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:08,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:08,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:08,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:08,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:08,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-09 15:32:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,008 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-09 15:32:09,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:09,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:09,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-09 15:32:09,039 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:09,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,041 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-09 15:32:09,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,056 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:09,060 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:09,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-09 15:32:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,082 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-09 15:32:09,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,095 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:09,096 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:09,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,109 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:09,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,111 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-09 15:32:09,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,123 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,127 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-09 15:32:09,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,144 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-09 15:32:09,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,155 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,157 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-09 15:32:09,174 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,176 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-09 15:32:09,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,187 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:09,192 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:09,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-09 15:32:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,210 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-09 15:32:09,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:09,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,222 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:09,224 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:09,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-09 15:32:09,238 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,239 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-09 15:32:09,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,251 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,251 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:09,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,251 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:09,254 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:09,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-09 15:32:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,275 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-09 15:32:09,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,286 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:09,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,287 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:09,288 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:09,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,309 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,311 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-09 15:32:09,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,328 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,328 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:09,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,328 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,334 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-11-09 15:32:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,364 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-09 15:32:09,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,380 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,380 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:09,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,380 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,384 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-09 15:32:09,406 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,408 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-09 15:32:09,423 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,424 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:09,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,424 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:09,431 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:09,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,469 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-09 15:32:09,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,484 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,485 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:09,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,485 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:09,489 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:09,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,518 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,520 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-09 15:32:09,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,535 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,535 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:09,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,536 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,540 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,565 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-09 15:32:09,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,580 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,580 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:09,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,581 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:09,583 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:09,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,601 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,603 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-09 15:32:09,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,618 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,618 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:09,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,619 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:09,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:09,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:09,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:09,655 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:09,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-09 15:32:09,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:09,669 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:09,670 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:09,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:09,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:09,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:09,670 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:09,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:09,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:09,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:09,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:09,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 15:32:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-11-09 15:32:09,697 INFO L87 Difference]: Start difference. First operand 451 states and 502 transitions. cyclomatic complexity: 55 Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:10,183 INFO L93 Difference]: Finished difference Result 976 states and 1060 transitions. [2024-11-09 15:32:10,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 976 states and 1060 transitions. [2024-11-09 15:32:10,186 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 161 [2024-11-09 15:32:10,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 976 states to 900 states and 976 transitions. [2024-11-09 15:32:10,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 900 [2024-11-09 15:32:10,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 900 [2024-11-09 15:32:10,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 900 states and 976 transitions. [2024-11-09 15:32:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:10,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 900 states and 976 transitions. [2024-11-09 15:32:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states and 976 transitions. [2024-11-09 15:32:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 606. [2024-11-09 15:32:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 606 states have (on average 1.099009900990099) internal successors, (666), 605 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 666 transitions. [2024-11-09 15:32:10,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 606 states and 666 transitions. [2024-11-09 15:32:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 15:32:10,200 INFO L425 stractBuchiCegarLoop]: Abstraction has 606 states and 666 transitions. [2024-11-09 15:32:10,200 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-09 15:32:10,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 606 states and 666 transitions. [2024-11-09 15:32:10,201 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 103 [2024-11-09 15:32:10,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:10,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:10,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-09 15:32:10,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:10,202 INFO L745 eck$LassoCheckResult]: Stem: 41995#$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(13, 2); 41977#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 41961#L59 assume !(0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296)); 41962#L59-1 mp_add_~nb~0#1 := 4; 42003#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 42001#L71 assume 0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 41996#L73 assume 0 == (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 41998#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 42209#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42207#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 42205#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 42203#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42201#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42199#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42197#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 42195#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 42193#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42191#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42189#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42187#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 42185#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 42183#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42181#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42179#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42177#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 42175#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42173#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 42171#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42169#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 42167#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42165#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42162#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 42159#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 42158#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42157#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 42156#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42155#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42154#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 42153#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42152#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 42151#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42150#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42148#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 42149#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42229#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 42225#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 42224#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42223#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42222#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 42221#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42220#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 42219#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42218#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 42217#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42216#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42215#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42212#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 42213#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 42346#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 42344#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42342#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42340#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42338#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 42337#L102-1 [2024-11-09 15:32:10,202 INFO L747 eck$LassoCheckResult]: Loop: 42337#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 42336#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42335#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 42334#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42333#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42332#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42214#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 41999#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 42000#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 42345#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42343#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42341#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42339#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 42337#L102-1 [2024-11-09 15:32:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1728940926, now seen corresponding path program 1 times [2024-11-09 15:32:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446980824] [2024-11-09 15:32:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:10,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:10,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:10,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 2 times [2024-11-09 15:32:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881206279] [2024-11-09 15:32:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:10,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:10,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:10,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 334650383, now seen corresponding path program 2 times [2024-11-09 15:32:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095905060] [2024-11-09 15:32:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095905060] [2024-11-09 15:32:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095905060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541467784] [2024-11-09 15:32:10,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:32:10,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:10,451 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:10,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2024-11-09 15:32:10,507 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:32:10,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:32:10,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:32:10,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 15:32:10,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 15:32:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541467784] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:10,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-11-09 15:32:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284425977] [2024-11-09 15:32:10,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:10,881 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:10,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:10,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:10,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:10,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:10,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:10,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:10,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:10,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration28_Loop [2024-11-09 15:32:10,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:10,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:10,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:10,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:11,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:11,117 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:11,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,121 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-09 15:32:11,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:11,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:11,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-11-09 15:32:11,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,184 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-09 15:32:11,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:11,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:11,486 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:11,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-09 15:32:11,493 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:11,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:11,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:11,493 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:11,493 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:11,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,493 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:11,493 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:11,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration28_Loop [2024-11-09 15:32:11,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:11,493 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:11,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:11,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:11,672 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:11,672 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:11,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,674 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-09 15:32:11,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:11,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:11,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-11-09 15:32:11,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,702 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-09 15:32:11,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:11,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:11,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:11,728 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,729 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-09 15:32:11,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,741 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:11,743 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:11,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-09 15:32:11,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,759 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-09 15:32:11,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,772 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:11,773 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:11,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-09 15:32:11,787 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,788 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-09 15:32:11,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,800 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:11,804 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:11,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-09 15:32:11,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,821 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-09 15:32:11,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,833 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:11,837 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:11,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:11,856 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,858 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-09 15:32:11,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,876 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:11,881 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:11,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:11,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,906 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-09 15:32:11,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:11,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:11,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,922 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:11,924 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:11,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:11,945 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,947 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-09 15:32:11,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-11-09 15:32:11,961 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:11,962 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:11,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:11,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:11,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:11,962 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:11,965 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:11,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:11,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:11,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:11,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:11,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:11,990 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-09 15:32:11,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,006 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,006 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:12,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,006 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:12,008 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:12,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:12,028 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:12,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,029 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-09 15:32:12,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,046 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,046 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:12,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,047 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:12,051 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:12,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,078 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-09 15:32:12,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,093 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,093 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:12,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,093 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:12,096 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:12,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:12,117 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,119 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-09 15:32:12,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,134 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,135 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:12,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,135 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:12,145 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:12,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:12,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,178 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-09 15:32:12,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,193 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,194 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:12,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,194 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:12,198 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:12,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:12,215 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:12,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,216 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-09 15:32:12,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,227 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,228 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:12,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,228 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:12,231 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:12,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-09 15:32:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,248 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-09 15:32:12,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,259 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,259 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:12,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,259 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:12,261 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:12,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-09 15:32:12,274 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:12,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,275 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-09 15:32:12,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,287 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,287 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:12,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,287 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:12,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:12,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-09 15:32:12,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:12,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:12,312 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:12,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-09 15:32:12,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:12,324 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:12,325 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:12,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:12,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:12,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:12,325 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:12,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:12,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:12,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:12,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-09 15:32:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:32:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:32:12,344 INFO L87 Difference]: Start difference. First operand 606 states and 666 transitions. cyclomatic complexity: 67 Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:13,317 INFO L93 Difference]: Finished difference Result 858 states and 930 transitions. [2024-11-09 15:32:13,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 858 states and 930 transitions. [2024-11-09 15:32:13,320 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 99 [2024-11-09 15:32:13,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 858 states to 707 states and 767 transitions. [2024-11-09 15:32:13,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 707 [2024-11-09 15:32:13,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 707 [2024-11-09 15:32:13,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 767 transitions. [2024-11-09 15:32:13,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:13,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 707 states and 767 transitions. [2024-11-09 15:32:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 767 transitions. [2024-11-09 15:32:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 487. [2024-11-09 15:32:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 487 states have (on average 1.1026694045174539) internal successors, (537), 486 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 537 transitions. [2024-11-09 15:32:13,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 487 states and 537 transitions. [2024-11-09 15:32:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 15:32:13,330 INFO L425 stractBuchiCegarLoop]: Abstraction has 487 states and 537 transitions. [2024-11-09 15:32:13,330 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-09 15:32:13,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 487 states and 537 transitions. [2024-11-09 15:32:13,331 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 73 [2024-11-09 15:32:13,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:13,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:13,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-09 15:32:13,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:13,332 INFO L745 eck$LassoCheckResult]: Stem: 43982#$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(13, 2); 43963#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 43948#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 43950#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 43952#L63 assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 43953#L59-1 mp_add_~nb~0#1 := 4; 43966#L69 assume !(0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296)); 43988#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 44271#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44270#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 44269#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 44268#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44266#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44264#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44262#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 44260#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 44258#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44256#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44254#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44252#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 44250#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 44248#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44246#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44244#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44242#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 44240#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44198#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 44183#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 44431#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44430#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 44429#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44428#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44427#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 44426#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44425#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 44424#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44423#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44422#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 44421#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44420#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 43965#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 44419#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44418#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44417#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 44416#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44415#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 44414#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44413#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44412#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 44411#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44410#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 44409#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44408#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 44073#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 44407#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44406#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44394#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44391#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 44392#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 44405#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44434#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44433#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 44432#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 43975#L102-1 [2024-11-09 15:32:13,332 INFO L747 eck$LassoCheckResult]: Loop: 43975#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 43971#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43972#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 43978#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 43976#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43977#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43955#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43956#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43957#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 43958#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43967#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43961#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43962#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 43975#L102-1 [2024-11-09 15:32:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1520812614, now seen corresponding path program 1 times [2024-11-09 15:32:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495638264] [2024-11-09 15:32:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:13,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:13,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 4 times [2024-11-09 15:32:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:13,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920045650] [2024-11-09 15:32:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:13,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:13,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2088026333, now seen corresponding path program 2 times [2024-11-09 15:32:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048789562] [2024-11-09 15:32:13,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 36 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048789562] [2024-11-09 15:32:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048789562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413957477] [2024-11-09 15:32:13,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:32:13,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:13,581 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:13,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2024-11-09 15:32:13,632 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:32:13,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:32:13,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:32:13,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 15:32:13,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 15:32:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413957477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:13,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-11-09 15:32:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610310461] [2024-11-09 15:32:13,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:13,986 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:13,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:13,986 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:13,986 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:13,986 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:13,986 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:13,986 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:13,986 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:13,986 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration29_Loop [2024-11-09 15:32:13,986 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:13,986 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:13,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:13,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:14,175 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:14,175 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,176 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-09 15:32:14,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:14,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:14,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-09 15:32:14,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,227 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-09 15:32:14,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:14,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:14,548 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:14,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-09 15:32:14,556 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:14,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:14,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:14,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:14,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:14,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:14,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:14,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration29_Loop [2024-11-09 15:32:14,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:14,556 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:14,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:14,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:14,722 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:14,722 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,723 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-09 15:32:14,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:14,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:14,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-09 15:32:14,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,752 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-09 15:32:14,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:14,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:14,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-11-09 15:32:14,777 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:14,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,778 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-09 15:32:14,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,790 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:14,792 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:14,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-11-09 15:32:14,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,810 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-09 15:32:14,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,822 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:14,823 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:14,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-11-09 15:32:14,838 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,840 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-09 15:32:14,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,852 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:14,855 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:14,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,872 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-09 15:32:14,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,886 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:14,888 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:14,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:14,901 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:14,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,902 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-09 15:32:14,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,915 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:14,921 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:14,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-11-09 15:32:14,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,946 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-09 15:32:14,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-11-09 15:32:14,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:14,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:14,964 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:14,967 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:14,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:14,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:14,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-09 15:32:14,986 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:14,987 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:14,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-09 15:32:14,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:14,999 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:14,999 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:14,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:14,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:14,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,000 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:15,002 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:15,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-09 15:32:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,020 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-09 15:32:15,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,031 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,031 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:15,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,032 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:15,033 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:15,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-09 15:32:15,047 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,048 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-09 15:32:15,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,060 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,060 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:15,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,060 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:15,064 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:15,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,084 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-09 15:32:15,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,095 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,096 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:15,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,096 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:15,098 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:15,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-09 15:32:15,113 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,115 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-09 15:32:15,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,127 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,127 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:15,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,127 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:15,132 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:15,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-11-09 15:32:15,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,156 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-09 15:32:15,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,168 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,168 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:15,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,168 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:15,171 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:15,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-09 15:32:15,188 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:15,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,189 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-09 15:32:15,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,201 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,202 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:15,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,202 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:15,206 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:15,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-09 15:32:15,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,223 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-09 15:32:15,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,234 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,235 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:15,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,235 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:15,237 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:15,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-09 15:32:15,250 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:15,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,252 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-09 15:32:15,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,264 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,264 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:15,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,264 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:15,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:15,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-09 15:32:15,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:15,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:15,290 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-09 15:32:15,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:15,304 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:15,304 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:15,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:15,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:15,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:15,305 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:15,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:15,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:15,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:15,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2024-11-09 15:32:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:32:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:32:15,324 INFO L87 Difference]: Start difference. First operand 487 states and 537 transitions. cyclomatic complexity: 55 Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:16,275 INFO L93 Difference]: Finished difference Result 665 states and 719 transitions. [2024-11-09 15:32:16,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 665 states and 719 transitions. [2024-11-09 15:32:16,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 62 [2024-11-09 15:32:16,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 665 states to 564 states and 607 transitions. [2024-11-09 15:32:16,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2024-11-09 15:32:16,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2024-11-09 15:32:16,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 607 transitions. [2024-11-09 15:32:16,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:16,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 564 states and 607 transitions. [2024-11-09 15:32:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 607 transitions. [2024-11-09 15:32:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 443. [2024-11-09 15:32:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 443 states have (on average 1.09255079006772) internal successors, (484), 442 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 484 transitions. [2024-11-09 15:32:16,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 443 states and 484 transitions. [2024-11-09 15:32:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 15:32:16,309 INFO L425 stractBuchiCegarLoop]: Abstraction has 443 states and 484 transitions. [2024-11-09 15:32:16,309 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-11-09 15:32:16,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 443 states and 484 transitions. [2024-11-09 15:32:16,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2024-11-09 15:32:16,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:16,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:16,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-09 15:32:16,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:16,311 INFO L745 eck$LassoCheckResult]: Stem: 45647#$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(13, 2); 45630#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 45620#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 45622#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 45624#L63 assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 45625#L59-1 mp_add_~nb~0#1 := 4; 45654#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 45651#L71 assume 0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 45653#L73 assume !(0 == (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296)); 45729#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 45730#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45725#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 45726#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 45721#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45722#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45717#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45718#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 45713#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 45714#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45709#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45710#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45705#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 45706#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 45701#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45702#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45697#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45698#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 45693#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45694#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 45692#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 45777#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45776#L90-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296); 45775#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45774#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45773#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 45772#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45771#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 45770#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45769#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45768#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 45767#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45663#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 45661#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 45660#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45658#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45659#L91-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296); 46011#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46010#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 46009#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46008#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46007#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 46006#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46005#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 46004#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 46003#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 45848#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 45849#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45648#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45649#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46001#L92-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296); 45999#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 45998#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45997#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45996#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45993#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 45994#L102-1 [2024-11-09 15:32:16,312 INFO L747 eck$LassoCheckResult]: Loop: 45994#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 46024#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45854#L83 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296)); 45855#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 45643#L90 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45644#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46002#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46020#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46019#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 46018#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46017#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 46016#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45995#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 45994#L102-1 [2024-11-09 15:32:16,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1891586717, now seen corresponding path program 1 times [2024-11-09 15:32:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261802023] [2024-11-09 15:32:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 15:32:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261802023] [2024-11-09 15:32:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261802023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788650032] [2024-11-09 15:32:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:16,545 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:16,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2024-11-09 15:32:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:16,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:32:16,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:32:16,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 15:32:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788650032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:16,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2024-11-09 15:32:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460302482] [2024-11-09 15:32:16,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:16,846 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:32:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 5 times [2024-11-09 15:32:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643367126] [2024-11-09 15:32:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:16,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:16,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:16,937 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:16,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:16,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:16,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:16,938 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:16,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:16,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:16,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:16,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration30_Loop [2024-11-09 15:32:16,938 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:16,938 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:16,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:16,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:17,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:17,120 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:17,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:17,123 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:17,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-09 15:32:17,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:17,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:17,144 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:32:17,144 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:32:17,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-09 15:32:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:17,156 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-09 15:32:17,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:17,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:17,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-09 15:32:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:17,197 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:17,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-09 15:32:17,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:17,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:17,974 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:17,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-09 15:32:17,981 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:17,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:17,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:17,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:17,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:17,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:17,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:17,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:17,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration30_Loop [2024-11-09 15:32:17,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:17,981 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:17,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:17,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:18,173 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:18,173 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:18,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,174 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-09 15:32:18,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:18,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:18,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-09 15:32:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,202 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-09 15:32:18,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:18,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:18,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-09 15:32:18,231 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,233 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-09 15:32:18,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,244 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:18,246 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:18,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-09 15:32:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,263 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-09 15:32:18,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,276 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:18,278 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:18,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-11-09 15:32:18,293 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:18,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,294 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-09 15:32:18,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,306 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,308 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-09 15:32:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,322 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-09 15:32:18,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,334 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,337 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-11-09 15:32:18,353 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:18,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,354 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-09 15:32:18,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,366 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:18,368 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:18,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-09 15:32:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,383 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-09 15:32:18,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:18,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,395 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:18,399 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:18,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-09 15:32:18,416 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:18,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,417 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-09 15:32:18,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,428 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,428 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:18,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,429 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:18,430 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:18,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-11-09 15:32:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,445 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-09 15:32:18,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,457 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,457 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:18,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,457 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:18,460 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:18,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-11-09 15:32:18,476 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,477 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-11-09 15:32:18,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,489 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,489 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:18,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,489 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,491 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-11-09 15:32:18,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,509 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-09 15:32:18,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,522 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,522 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:18,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,522 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,526 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-09 15:32:18,549 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:18,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,550 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-09 15:32:18,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,562 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,562 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:18,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,562 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:18,565 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:18,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-09 15:32:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,585 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-09 15:32:18,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,597 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,597 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:18,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,598 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:18,604 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:18,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2024-11-09 15:32:18,629 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:18,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,630 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-09 15:32:18,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,641 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,642 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:18,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,642 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,643 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2024-11-09 15:32:18,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,659 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-09 15:32:18,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,670 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,670 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:18,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,671 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:18,674 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:18,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-11-09 15:32:18,691 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:18,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,692 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-09 15:32:18,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,703 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,704 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:18,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,704 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:18,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:18,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-11-09 15:32:18,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:18,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:18,724 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:18,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-09 15:32:18,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:18,735 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:18,736 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:18,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:18,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:18,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:18,736 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:18,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:18,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:18,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:18,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-09 15:32:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:18,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:32:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:32:18,761 INFO L87 Difference]: Start difference. First operand 443 states and 484 transitions. cyclomatic complexity: 44 Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:19,602 INFO L93 Difference]: Finished difference Result 570 states and 610 transitions. [2024-11-09 15:32:19,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 610 transitions. [2024-11-09 15:32:19,604 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2024-11-09 15:32:19,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 368 states and 391 transitions. [2024-11-09 15:32:19,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2024-11-09 15:32:19,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2024-11-09 15:32:19,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 391 transitions. [2024-11-09 15:32:19,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:19,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 368 states and 391 transitions. [2024-11-09 15:32:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 391 transitions. [2024-11-09 15:32:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 216. [2024-11-09 15:32:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 216 states have (on average 1.0648148148148149) internal successors, (230), 215 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 230 transitions. [2024-11-09 15:32:19,611 INFO L240 hiAutomatonCegarLoop]: Abstraction has 216 states and 230 transitions. [2024-11-09 15:32:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 15:32:19,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 216 states and 230 transitions. [2024-11-09 15:32:19,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-11-09 15:32:19,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 230 transitions. [2024-11-09 15:32:19,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:32:19,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:19,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:19,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 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] [2024-11-09 15:32:19,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:19,614 INFO L745 eck$LassoCheckResult]: Stem: 47112#$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(13, 2); 47095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret6#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;havoc main_#t~nondet4#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~bitwise1#1, mp_add_#t~bitwise2#1, mp_add_#t~bitwise3#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 % 4294967296 / 256;mp_add_~a2~0#1 := mp_add_~a#1 % 4294967296 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 % 4294967296 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 % 4294967296 / 256;mp_add_~b2~0#1 := mp_add_~b#1 % 4294967296 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 % 4294967296 / 16777216;mp_add_~na~0#1 := 4; 47086#L59 assume 0 == (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 47087#L61 assume 0 == (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 47088#L63 assume 0 == (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~na~0#1 := (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) - 1; 47089#L59-1 mp_add_~nb~0#1 := 4; 47098#L69 assume 0 == (if mp_add_~b3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b3~0#1 % 256 % 4294967296 else mp_add_~b3~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 47092#L71 assume 0 == (if mp_add_~b2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b2~0#1 % 256 % 4294967296 else mp_add_~b2~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 47094#L73 assume 0 == (if mp_add_~b1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b1~0#1 % 256 % 4294967296 else mp_add_~b1~0#1 % 256 % 4294967296 - 4294967296);mp_add_~nb~0#1 := (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296) - 1; 47115#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 47220#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47221#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 47216#L84 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a0~0#1 % 256 % 4294967296 else mp_add_~a0~0#1 % 256 % 4294967296 - 4294967296); 47217#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47212#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47213#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47208#L83-1 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296); 47209#L90 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~b0~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~b0~0#1 % 256 % 4294967296 else mp_add_~b0~0#1 % 256 % 4294967296 - 4294967296); 47265#L90-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47266#L91-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47261#L92-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47262#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 47257#L95-1 assume 0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 47258#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47253#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47254#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47249#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 47250#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47245#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 47246#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47241#L84-2 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a1~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a1~0#1 % 256 % 4294967296 else mp_add_~a1~0#1 % 256 % 4294967296 - 4294967296); 47242#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47225#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47226#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 47293#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 47292#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47291#L99-1 assume 1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 47290#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47289#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47288#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 47287#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47286#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 47285#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47284#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47283#L85-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a2~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a2~0#1 % 256 % 4294967296 else mp_add_~a2~0#1 % 256 % 4294967296 - 4294967296); 47282#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47281#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 47280#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 47279#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47278#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47277#L100-1 assume 2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 47276#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47275#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 47274#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47273#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 47272#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47271#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47270#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47268#L86-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~partial_sum~0#1 := (if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) + (if mp_add_~a3~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~a3~0#1 % 256 % 4294967296 else mp_add_~a3~0#1 % 256 % 4294967296 - 4294967296); 47269#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 47081#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 47116#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47099#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47090#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47091#L101-1 assume 3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296);mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 47107#L102-1 [2024-11-09 15:32:19,615 INFO L747 eck$LassoCheckResult]: Loop: 47107#L102-1 mp_add_~i~0#1 := 1 + (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296); 47103#L80-2 assume !!(((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296) || (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)) || 0 != (if mp_add_~carry~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~carry~0#1 % 65536 % 4294967296 else mp_add_~carry~0#1 % 65536 % 4294967296 - 4294967296));mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47104#L83 assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296); 47101#L84 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47102#L84-2 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47105#L85-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47096#L86-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47097#L83-1 assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296)); 47082#L89 assume !((if mp_add_~partial_sum~0#1 % 65536 % 4294967296 <= 2147483647 then mp_add_~partial_sum~0#1 % 65536 % 4294967296 else mp_add_~partial_sum~0#1 % 65536 % 4294967296 - 4294967296) > 254); 47083#L95-1 assume !(0 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47295#L99-1 assume !(1 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47294#L100-1 assume !(2 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47106#L101-1 assume !(3 == (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296)); 47107#L102-1 [2024-11-09 15:32:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1221245325, now seen corresponding path program 1 times [2024-11-09 15:32:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497933977] [2024-11-09 15:32:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 15:32:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497933977] [2024-11-09 15:32:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497933977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:32:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658487463] [2024-11-09 15:32:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:32:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:19,916 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:32:19,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2024-11-09 15:32:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:20,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 15:32:20,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:32:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 15:32:20,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:32:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:32:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658487463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:32:20,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:32:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 36 [2024-11-09 15:32:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734394872] [2024-11-09 15:32:20,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:32:20,749 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:32:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 3 times [2024-11-09 15:32:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931858372] [2024-11-09 15:32:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:20,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:20,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:20,820 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:20,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:20,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:20,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:20,821 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:32:20,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:20,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:20,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:20,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration31_Loop [2024-11-09 15:32:20,821 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:20,821 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:20,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:20,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:21,019 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:21,019 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:32:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,022 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-09 15:32:21,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:32:21,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:21,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:21,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,067 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-09 15:32:21,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:32:21,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:32:21,364 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:32:21,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-11-09 15:32:21,370 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:32:21,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:32:21,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:32:21,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:32:21,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:32:21,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:32:21,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:32:21,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration31_Loop [2024-11-09 15:32:21,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:32:21,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:32:21,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:21,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:32:21,555 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:32:21,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:32:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,557 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-09 15:32:21,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:21,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:21,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-11-09 15:32:21,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,583 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-09 15:32:21,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:32:21,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:32:21,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:21,610 INFO L451 LassoAnalysis]: Using template '2-nested'. [2024-11-09 15:32:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,612 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-09 15:32:21,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,624 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:21,625 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:21,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:21,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,639 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-09 15:32:21,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,651 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:21,654 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:21,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-11-09 15:32:21,669 INFO L451 LassoAnalysis]: Using template '3-nested'. [2024-11-09 15:32:21,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,671 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-09 15:32:21,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,683 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:21,684 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:21,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-09 15:32:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,699 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-09 15:32:21,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,712 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:21,715 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:21,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-11-09 15:32:21,749 INFO L451 LassoAnalysis]: Using template '4-nested'. [2024-11-09 15:32:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,751 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-11-09 15:32:21,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,762 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:21,764 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:21,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-11-09 15:32:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,780 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-11-09 15:32:21,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:32:21,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,792 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:21,796 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:21,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:21,813 INFO L451 LassoAnalysis]: Using template '2-phase'. [2024-11-09 15:32:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,814 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-11-09 15:32:21,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,825 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,826 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:21,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,826 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:21,827 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:21,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,842 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-11-09 15:32:21,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,854 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,854 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:21,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,855 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2024-11-09 15:32:21,857 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2024-11-09 15:32:21,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-11-09 15:32:21,873 INFO L451 LassoAnalysis]: Using template '3-phase'. [2024-11-09 15:32:21,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,875 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-11-09 15:32:21,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,886 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,886 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:21,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,886 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:21,888 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:21,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-11-09 15:32:21,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,905 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-11-09 15:32:21,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,917 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,917 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2024-11-09 15:32:21,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,918 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:21,921 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:21,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-11-09 15:32:21,940 INFO L451 LassoAnalysis]: Using template '4-phase'. [2024-11-09 15:32:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,941 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-11-09 15:32:21,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,954 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:21,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,954 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:21,957 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:21,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:21,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:21,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-11-09 15:32:21,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,978 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:21,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-11-09 15:32:21,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:21,990 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:21,990 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:21,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:21,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:21,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:21,990 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2024-11-09 15:32:21,996 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2024-11-09 15:32:21,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:22,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:22,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-11-09 15:32:22,020 INFO L451 LassoAnalysis]: Using template '2-lex'. [2024-11-09 15:32:22,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:22,021 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:22,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-09 15:32:22,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:22,032 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:22,032 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:22,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:22,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:22,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:22,033 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:22,035 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:22,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:22,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:22,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-09 15:32:22,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:22,050 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-11-09 15:32:22,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:22,062 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:22,062 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2024-11-09 15:32:22,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:22,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:22,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:22,062 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2024-11-09 15:32:22,066 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 15:32:22,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:22,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:22,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-11-09 15:32:22,082 INFO L451 LassoAnalysis]: Using template '3-lex'. [2024-11-09 15:32:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:22,083 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:22,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-09 15:32:22,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:22,094 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:22,095 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:22,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:22,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:22,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:22,095 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:22,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:22,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:22,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:22,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-11-09 15:32:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:22,115 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:22,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-09 15:32:22,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:32:22,126 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2024-11-09 15:32:22,127 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2024-11-09 15:32:22,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:32:22,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:32:22,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:32:22,127 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2024-11-09 15:32:22,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:32:22,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:32:22,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:32:22,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-09 15:32:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 15:32:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 15:32:22,154 INFO L87 Difference]: Start difference. First operand 216 states and 230 transitions. cyclomatic complexity: 15 Second operand has 36 states, 36 states have (on average 4.694444444444445) internal successors, (169), 36 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,930 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2024-11-09 15:32:22,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 146 transitions. [2024-11-09 15:32:22,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:32:22,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:32:22,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:32:22,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 15:32:22,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L332 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2024-11-09 15:32:22,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:32:22,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:32:22,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:32:22,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:32:22 BoogieIcfgContainer [2024-11-09 15:32:22,938 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:32:22,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:32:22,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:32:22,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:32:22,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:31:41" (3/4) ... [2024-11-09 15:32:22,940 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:32:22,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:32:22,942 INFO L158 Benchmark]: Toolchain (without parser) took 42445.20ms. Allocated memory was 178.3MB in the beginning and 570.4MB in the end (delta: 392.2MB). Free memory was 129.4MB in the beginning and 405.7MB in the end (delta: -276.3MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,942 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:22,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.27ms. Allocated memory is still 178.3MB. Free memory was 129.0MB in the beginning and 114.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 178.3MB. Free memory was 113.8MB in the beginning and 110.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,943 INFO L158 Benchmark]: Boogie Preprocessor took 54.54ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 108.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,943 INFO L158 Benchmark]: RCFGBuilder took 601.29ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 85.7MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,943 INFO L158 Benchmark]: BuchiAutomizer took 41406.69ms. Allocated memory was 178.3MB in the beginning and 570.4MB in the end (delta: 392.2MB). Free memory was 85.3MB in the beginning and 405.7MB in the end (delta: -320.4MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-11-09 15:32:22,943 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 570.4MB. Free memory is still 405.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:22,944 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.22ms. Allocated memory is still 178.3MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.27ms. Allocated memory is still 178.3MB. Free memory was 129.0MB in the beginning and 114.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 178.3MB. Free memory was 113.8MB in the beginning and 110.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.54ms. Allocated memory is still 178.3MB. Free memory was 110.8MB in the beginning and 108.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 601.29ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 85.7MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 41406.69ms. Allocated memory was 178.3MB in the beginning and 570.4MB in the end (delta: 392.2MB). Free memory was 85.3MB in the beginning and 405.7MB in the end (delta: -320.4MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 570.4MB. Free memory is still 405.7MB. 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 31 terminating modules (31 trivial, 0 deterministic, 0 nondeterministic). 31 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.3s and 32 iterations. TraceHistogramMax:7. Analysis of lassos took 25.3s. Construction of modules took 8.5s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 0. Minimization of det autom 31. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 12110 StatesRemovedByMinimization, 30 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7729 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7729 mSDsluCounter, 4983 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3565 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14214 IncrementalHoareTripleChecker+Invalid, 14992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 1418 mSDtfsCounter, 14214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc3 concLT0 SILN0 SILU5 SILI8 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp81 ukn100 mio100 lsp100 div381 bol100 ite100 ukn100 eq145 hnf96 smp34 dnf100 smp100 tf102 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 38ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:32:22,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2024-11-09 15:32:23,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2024-11-09 15:32:23,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2024-11-09 15:32:23,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:23,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-09 15:32:24,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:24,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 15:32:24,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 15:32:24,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 15:32:24,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 15:32:25,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:25,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 15:32:25,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 15:32:25,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:25,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:26,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:32:26,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 15:32:26,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 15:32:26,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 15:32:26,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE