./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:13:41,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:13:41,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:13:41,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:13:41,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:13:41,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:13:41,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:13:41,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:13:41,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:13:41,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:13:41,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:13:41,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:13:41,154 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:13:41,154 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:13:41,154 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:13:41,154 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:13:41,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:13:41,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:13:41,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:13:41,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:13:41,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:13:41,156 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:13:41,156 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2025-01-10 07:13:41,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:13:41,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:13:41,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:13:41,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:13:41,388 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:13:41,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-10 07:13:42,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d34b03eb/267ff60cde134354a0b50ae8e454cceb/FLAG584d8ce5d [2025-01-10 07:13:42,730 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:13:42,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-01-10 07:13:42,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d34b03eb/267ff60cde134354a0b50ae8e454cceb/FLAG584d8ce5d [2025-01-10 07:13:43,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d34b03eb/267ff60cde134354a0b50ae8e454cceb [2025-01-10 07:13:43,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:13:43,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:13:43,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:13:43,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:13:43,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:13:43,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43167eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43, skipping insertion in model container [2025-01-10 07:13:43,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:13:43,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:13:43,271 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:13:43,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:13:43,317 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:13:43,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43 WrapperNode [2025-01-10 07:13:43,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:13:43,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:13:43,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:13:43,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:13:43,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,353 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2025-01-10 07:13:43,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:13:43,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:13:43,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:13:43,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:13:43,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,376 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 07:13:43,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:13:43,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:13:43,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:13:43,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:13:43,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (1/1) ... [2025-01-10 07:13:43,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:43,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:43,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:13:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:13:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:13:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:13:43,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:13:43,488 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:13:43,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:13:43,727 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-10 07:13:43,728 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:13:43,735 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:13:43,736 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:13:43,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:13:43 BoogieIcfgContainer [2025-01-10 07:13:43,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:13:43,737 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:13:43,737 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:13:43,740 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:13:43,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:13:43,740 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:13:43" (1/3) ... [2025-01-10 07:13:43,741 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ddd68bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:13:43, skipping insertion in model container [2025-01-10 07:13:43,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:13:43,741 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:13:43" (2/3) ... [2025-01-10 07:13:43,741 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ddd68bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:13:43, skipping insertion in model container [2025-01-10 07:13:43,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:13:43,741 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:13:43" (3/3) ... [2025-01-10 07:13:43,742 INFO L363 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2025-01-10 07:13:43,774 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:13:43,774 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:13:43,774 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:13:43,774 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:13:43,774 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:13:43,774 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:13:43,774 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:13:43,774 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:13:43,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:43,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-01-10 07:13:43,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:43,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:43,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:13:43,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:43,799 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:13:43,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:43,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-01-10 07:13:43,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:43,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:43,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:13:43,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:43,808 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" [2025-01-10 07:13:43,812 INFO L754 eck$LassoCheckResult]: Loop: "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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;" "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;" "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;" "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;" "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);" [2025-01-10 07:13:43,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2025-01-10 07:13:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844074232] [2025-01-10 07:13:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:43,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:13:43,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:13:43,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:43,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:43,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:43,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:13:43,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:13:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:43,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 350949433, now seen corresponding path program 1 times [2025-01-10 07:13:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770175729] [2025-01-10 07:13:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:43,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:13:43,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:13:43,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770175729] [2025-01-10 07:13:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770175729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280434897] [2025-01-10 07:13:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:44,019 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:44,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:13:44,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:13:44,041 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 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) [2025-01-10 07:13:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:44,168 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2025-01-10 07:13:44,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. [2025-01-10 07:13:44,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2025-01-10 07:13:44,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 56 states and 86 transitions. [2025-01-10 07:13:44,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-01-10 07:13:44,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-01-10 07:13:44,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2025-01-10 07:13:44,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:44,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-01-10 07:13:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2025-01-10 07:13:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-01-10 07:13:44,195 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) [2025-01-10 07:13:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2025-01-10 07:13:44,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 84 transitions. [2025-01-10 07:13:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:13:44,201 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2025-01-10 07:13:44,201 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:13:44,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2025-01-10 07:13:44,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-01-10 07:13:44,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:44,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:44,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,202 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-01-10 07:13:44,205 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" [2025-01-10 07:13:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 532072644, now seen corresponding path program 1 times [2025-01-10 07:13:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520285138] [2025-01-10 07:13:44,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:44,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:13:44,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:13:44,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:44,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520285138] [2025-01-10 07:13:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520285138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893651335] [2025-01-10 07:13:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:44,493 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -124080635, now seen corresponding path program 1 times [2025-01-10 07:13:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12816245] [2025-01-10 07:13:44,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:44,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:44,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:44,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:44,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12816245] [2025-01-10 07:13:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12816245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928999401] [2025-01-10 07:13:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:44,585 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:44,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:44,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:13:44,586 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) [2025-01-10 07:13:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:44,780 INFO L93 Difference]: Finished difference Result 140 states and 215 transitions. [2025-01-10 07:13:44,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 215 transitions. [2025-01-10 07:13:44,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2025-01-10 07:13:44,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 140 states and 215 transitions. [2025-01-10 07:13:44,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2025-01-10 07:13:44,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2025-01-10 07:13:44,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 215 transitions. [2025-01-10 07:13:44,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:44,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 215 transitions. [2025-01-10 07:13:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 215 transitions. [2025-01-10 07:13:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2025-01-10 07:13:44,790 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) [2025-01-10 07:13:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2025-01-10 07:13:44,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 113 transitions. [2025-01-10 07:13:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:13:44,793 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2025-01-10 07:13:44,794 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:13:44,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2025-01-10 07:13:44,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-01-10 07:13:44,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:44,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:44,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,796 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" [2025-01-10 07:13:44,797 INFO L754 eck$LassoCheckResult]: Loop: "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" [2025-01-10 07:13:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash -384676730, now seen corresponding path program 1 times [2025-01-10 07:13:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605605865] [2025-01-10 07:13:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:44,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:13:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:13:44,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:44,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:44,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605605865] [2025-01-10 07:13:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605605865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830895977] [2025-01-10 07:13:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:44,905 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash -124080635, now seen corresponding path program 2 times [2025-01-10 07:13:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914915920] [2025-01-10 07:13:44,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:44,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:44,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:44,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:44,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914915920] [2025-01-10 07:13:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914915920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36069808] [2025-01-10 07:13:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:44,975 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:44,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:13:44,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:13:44,975 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 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) [2025-01-10 07:13:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:44,979 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2025-01-10 07:13:44,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 93 transitions. [2025-01-10 07:13:44,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-01-10 07:13:44,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 93 transitions. [2025-01-10 07:13:44,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-01-10 07:13:44,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-01-10 07:13:44,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 93 transitions. [2025-01-10 07:13:44,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:44,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 93 transitions. [2025-01-10 07:13:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 93 transitions. [2025-01-10 07:13:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 07:13:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2025-01-10 07:13:44,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 93 transitions. [2025-01-10 07:13:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:13:44,987 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2025-01-10 07:13:44,987 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:13:44,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 93 transitions. [2025-01-10 07:13:44,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2025-01-10 07:13:44,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:44,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:44,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:44,988 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:44,988 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1460006620, now seen corresponding path program 1 times [2025-01-10 07:13:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146201820] [2025-01-10 07:13:44,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:44,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:13:45,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:13:45,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:45,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146201820] [2025-01-10 07:13:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146201820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88440369] [2025-01-10 07:13:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,096 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:45,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1376242739, now seen corresponding path program 3 times [2025-01-10 07:13:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487272168] [2025-01-10 07:13:45,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:45,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:45,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:13:45,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487272168] [2025-01-10 07:13:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487272168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651392775] [2025-01-10 07:13:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,149 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:13:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:13:45,150 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. cyclomatic complexity: 29 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2025-01-10 07:13:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:45,260 INFO L93 Difference]: Finished difference Result 91 states and 134 transitions. [2025-01-10 07:13:45,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 134 transitions. [2025-01-10 07:13:45,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2025-01-10 07:13:45,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 134 transitions. [2025-01-10 07:13:45,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-01-10 07:13:45,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-01-10 07:13:45,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 134 transitions. [2025-01-10 07:13:45,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:45,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 134 transitions. [2025-01-10 07:13:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 134 transitions. [2025-01-10 07:13:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2025-01-10 07:13:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 82 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-01-10 07:13:45,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-01-10 07:13:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:13:45,265 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-01-10 07:13:45,265 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:13:45,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 120 transitions. [2025-01-10 07:13:45,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2025-01-10 07:13:45,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:45,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:45,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,267 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:45,267 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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;" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:45,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1460006620, now seen corresponding path program 2 times [2025-01-10 07:13:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986425474] [2025-01-10 07:13:45,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:13:45,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:13:45,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:45,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986425474] [2025-01-10 07:13:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986425474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84933607] [2025-01-10 07:13:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,350 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -534912943, now seen corresponding path program 1 times [2025-01-10 07:13:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950619509] [2025-01-10 07:13:45,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950619509] [2025-01-10 07:13:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950619509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889866314] [2025-01-10 07:13:45,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,376 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:45,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:13:45,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:13:45,377 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:45,493 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. [2025-01-10 07:13:45,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 218 transitions. [2025-01-10 07:13:45,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 100 [2025-01-10 07:13:45,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 152 states and 218 transitions. [2025-01-10 07:13:45,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2025-01-10 07:13:45,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2025-01-10 07:13:45,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 218 transitions. [2025-01-10 07:13:45,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:45,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 218 transitions. [2025-01-10 07:13:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 218 transitions. [2025-01-10 07:13:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2025-01-10 07:13:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-01-10 07:13:45,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-10 07:13:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:13:45,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-10 07:13:45,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:13:45,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2025-01-10 07:13:45,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2025-01-10 07:13:45,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:45,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:45,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,505 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:45,505 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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;" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1784706029, now seen corresponding path program 1 times [2025-01-10 07:13:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73435096] [2025-01-10 07:13:45,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:13:45,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:13:45,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73435096] [2025-01-10 07:13:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73435096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:13:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924584326] [2025-01-10 07:13:45,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,597 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:45,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash -534912943, now seen corresponding path program 2 times [2025-01-10 07:13:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090216665] [2025-01-10 07:13:45,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 07:13:45,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 22 statements. [2025-01-10 07:13:45,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:45,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090216665] [2025-01-10 07:13:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090216665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555781063] [2025-01-10 07:13:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:45,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:45,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:13:45,621 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:45,818 INFO L93 Difference]: Finished difference Result 221 states and 316 transitions. [2025-01-10 07:13:45,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 316 transitions. [2025-01-10 07:13:45,819 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 144 [2025-01-10 07:13:45,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 316 transitions. [2025-01-10 07:13:45,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2025-01-10 07:13:45,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-01-10 07:13:45,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 316 transitions. [2025-01-10 07:13:45,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:45,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 221 states and 316 transitions. [2025-01-10 07:13:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 316 transitions. [2025-01-10 07:13:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 91. [2025-01-10 07:13:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-01-10 07:13:45,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-10 07:13:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:13:45,829 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-10 07:13:45,830 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:13:45,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2025-01-10 07:13:45,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2025-01-10 07:13:45,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:45,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:45,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:45,831 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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;" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:45,831 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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;" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2051247079, now seen corresponding path program 1 times [2025-01-10 07:13:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921826026] [2025-01-10 07:13:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:13:45,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:13:45,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:45,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:45,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921826026] [2025-01-10 07:13:45,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921826026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651367404] [2025-01-10 07:13:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,927 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1365752633, now seen corresponding path program 1 times [2025-01-10 07:13:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010580041] [2025-01-10 07:13:45,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010580041] [2025-01-10 07:13:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010580041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:45,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157544289] [2025-01-10 07:13:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:45,948 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:45,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:45,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:13:45,949 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:46,042 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2025-01-10 07:13:46,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 305 transitions. [2025-01-10 07:13:46,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 167 [2025-01-10 07:13:46,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 305 transitions. [2025-01-10 07:13:46,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2025-01-10 07:13:46,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2025-01-10 07:13:46,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 305 transitions. [2025-01-10 07:13:46,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:46,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 305 transitions. [2025-01-10 07:13:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 305 transitions. [2025-01-10 07:13:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 149. [2025-01-10 07:13:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.5033557046979866) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2025-01-10 07:13:46,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 224 transitions. [2025-01-10 07:13:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:13:46,055 INFO L432 stractBuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2025-01-10 07:13:46,055 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:13:46,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 224 transitions. [2025-01-10 07:13:46,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2025-01-10 07:13:46,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:46,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:46,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,056 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:46,056 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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;" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:46,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 1 times [2025-01-10 07:13:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801364284] [2025-01-10 07:13:46,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -534912943, now seen corresponding path program 3 times [2025-01-10 07:13:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835842366] [2025-01-10 07:13:46,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-01-10 07:13:46,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 22 statements. [2025-01-10 07:13:46,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:13:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835842366] [2025-01-10 07:13:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835842366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758456289] [2025-01-10 07:13:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:46,122 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:13:46,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:13:46,124 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. cyclomatic complexity: 77 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2025-01-10 07:13:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:46,193 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2025-01-10 07:13:46,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 283 transitions. [2025-01-10 07:13:46,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2025-01-10 07:13:46,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 283 transitions. [2025-01-10 07:13:46,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-01-10 07:13:46,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2025-01-10 07:13:46,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 283 transitions. [2025-01-10 07:13:46,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:46,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 283 transitions. [2025-01-10 07:13:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 283 transitions. [2025-01-10 07:13:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-01-10 07:13:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 190 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2025-01-10 07:13:46,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 191 states and 280 transitions. [2025-01-10 07:13:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:13:46,206 INFO L432 stractBuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2025-01-10 07:13:46,206 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:13:46,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 280 transitions. [2025-01-10 07:13:46,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2025-01-10 07:13:46,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:46,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:46,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,208 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:46,208 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:46,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 2 times [2025-01-10 07:13:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744507706] [2025-01-10 07:13:46,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:46,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:46,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1673790201, now seen corresponding path program 1 times [2025-01-10 07:13:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114095706] [2025-01-10 07:13:46,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:46,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114095706] [2025-01-10 07:13:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114095706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:13:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220885014] [2025-01-10 07:13:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:46,335 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:13:46,336 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. cyclomatic complexity: 91 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) [2025-01-10 07:13:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:46,533 INFO L93 Difference]: Finished difference Result 341 states and 499 transitions. [2025-01-10 07:13:46,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 499 transitions. [2025-01-10 07:13:46,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 305 [2025-01-10 07:13:46,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 499 transitions. [2025-01-10 07:13:46,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2025-01-10 07:13:46,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2025-01-10 07:13:46,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 499 transitions. [2025-01-10 07:13:46,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:46,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 341 states and 499 transitions. [2025-01-10 07:13:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 499 transitions. [2025-01-10 07:13:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 287. [2025-01-10 07:13:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 287 states have (on average 1.456445993031359) internal successors, (418), 286 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2025-01-10 07:13:46,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 287 states and 418 transitions. [2025-01-10 07:13:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:13:46,550 INFO L432 stractBuchiCegarLoop]: Abstraction has 287 states and 418 transitions. [2025-01-10 07:13:46,551 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:13:46,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 418 transitions. [2025-01-10 07:13:46,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 251 [2025-01-10 07:13:46,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:46,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:46,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,553 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:46,555 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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;" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 3 times [2025-01-10 07:13:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424327372] [2025-01-10 07:13:46,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:13:46,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:46,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1623918071, now seen corresponding path program 1 times [2025-01-10 07:13:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131350783] [2025-01-10 07:13:46,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 07:13:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131350783] [2025-01-10 07:13:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131350783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:13:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828038272] [2025-01-10 07:13:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:46,625 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:13:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:13:46,625 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2025-01-10 07:13:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:46,687 INFO L93 Difference]: Finished difference Result 339 states and 494 transitions. [2025-01-10 07:13:46,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 339 states and 494 transitions. [2025-01-10 07:13:46,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 303 [2025-01-10 07:13:46,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 339 states to 339 states and 494 transitions. [2025-01-10 07:13:46,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2025-01-10 07:13:46,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2025-01-10 07:13:46,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 494 transitions. [2025-01-10 07:13:46,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:46,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 339 states and 494 transitions. [2025-01-10 07:13:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 494 transitions. [2025-01-10 07:13:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2025-01-10 07:13:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.4654654654654655) internal successors, (488), 332 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 488 transitions. [2025-01-10 07:13:46,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 488 transitions. [2025-01-10 07:13:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:13:46,700 INFO L432 stractBuchiCegarLoop]: Abstraction has 333 states and 488 transitions. [2025-01-10 07:13:46,700 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:13:46,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 488 transitions. [2025-01-10 07:13:46,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 297 [2025-01-10 07:13:46,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:46,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:46,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:46,703 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:46,703 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 4 times [2025-01-10 07:13:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011005449] [2025-01-10 07:13:46,704 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:13:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-01-10 07:13:46,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:13:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:46,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:46,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:46,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:46,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:46,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1969984647, now seen corresponding path program 1 times [2025-01-10 07:13:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822477592] [2025-01-10 07:13:46,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:46,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:46,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822477592] [2025-01-10 07:13:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822477592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308979606] [2025-01-10 07:13:46,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:46,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:46,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:46,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:13:46,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:46,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:46,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:46,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:13:46,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:46,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308979606] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:46,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-01-10 07:13:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792255561] [2025-01-10 07:13:46,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:46,991 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:46,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:13:46,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:13:46,992 INFO L87 Difference]: Start difference. First operand 333 states and 488 transitions. cyclomatic complexity: 157 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:47,234 INFO L93 Difference]: Finished difference Result 427 states and 602 transitions. [2025-01-10 07:13:47,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 602 transitions. [2025-01-10 07:13:47,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 386 [2025-01-10 07:13:47,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 427 states and 602 transitions. [2025-01-10 07:13:47,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2025-01-10 07:13:47,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2025-01-10 07:13:47,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 427 states and 602 transitions. [2025-01-10 07:13:47,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:47,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 427 states and 602 transitions. [2025-01-10 07:13:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states and 602 transitions. [2025-01-10 07:13:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2025-01-10 07:13:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 329 states have (on average 1.452887537993921) internal successors, (478), 328 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 478 transitions. [2025-01-10 07:13:47,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 329 states and 478 transitions. [2025-01-10 07:13:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:13:47,251 INFO L432 stractBuchiCegarLoop]: Abstraction has 329 states and 478 transitions. [2025-01-10 07:13:47,251 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:13:47,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 478 transitions. [2025-01-10 07:13:47,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 293 [2025-01-10 07:13:47,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:47,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:47,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,253 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:47,253 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:47,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 5 times [2025-01-10 07:13:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610074849] [2025-01-10 07:13:47,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:13:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:47,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:47,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2126204169, now seen corresponding path program 1 times [2025-01-10 07:13:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686488049] [2025-01-10 07:13:47,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:13:47,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:13:47,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686488049] [2025-01-10 07:13:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686488049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481739808] [2025-01-10 07:13:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:47,336 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:47,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:13:47,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:13:47,337 INFO L87 Difference]: Start difference. First operand 329 states and 478 transitions. cyclomatic complexity: 151 Second operand has 4 states, 4 states have (on average 6.5) 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) [2025-01-10 07:13:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:47,457 INFO L93 Difference]: Finished difference Result 491 states and 693 transitions. [2025-01-10 07:13:47,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 491 states and 693 transitions. [2025-01-10 07:13:47,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 455 [2025-01-10 07:13:47,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 491 states to 491 states and 693 transitions. [2025-01-10 07:13:47,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2025-01-10 07:13:47,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2025-01-10 07:13:47,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 693 transitions. [2025-01-10 07:13:47,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:47,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 491 states and 693 transitions. [2025-01-10 07:13:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 693 transitions. [2025-01-10 07:13:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 396. [2025-01-10 07:13:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.446969696969697) internal successors, (573), 395 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 573 transitions. [2025-01-10 07:13:47,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 396 states and 573 transitions. [2025-01-10 07:13:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:13:47,468 INFO L432 stractBuchiCegarLoop]: Abstraction has 396 states and 573 transitions. [2025-01-10 07:13:47,468 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:13:47,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 573 transitions. [2025-01-10 07:13:47,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 360 [2025-01-10 07:13:47,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:47,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:47,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,470 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:47,470 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" [2025-01-10 07:13:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 6 times [2025-01-10 07:13:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633892385] [2025-01-10 07:13:47,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:13:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,481 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,490 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,490 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:13:47,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:47,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1191864969, now seen corresponding path program 1 times [2025-01-10 07:13:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656535129] [2025-01-10 07:13:47,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:13:47,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:13:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656535129] [2025-01-10 07:13:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656535129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:47,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:47,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:13:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530106601] [2025-01-10 07:13:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:47,570 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:47,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:13:47,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:13:47,571 INFO L87 Difference]: Start difference. First operand 396 states and 573 transitions. cyclomatic complexity: 179 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:47,635 INFO L93 Difference]: Finished difference Result 463 states and 650 transitions. [2025-01-10 07:13:47,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 463 states and 650 transitions. [2025-01-10 07:13:47,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 427 [2025-01-10 07:13:47,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 463 states to 463 states and 650 transitions. [2025-01-10 07:13:47,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-01-10 07:13:47,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2025-01-10 07:13:47,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 463 states and 650 transitions. [2025-01-10 07:13:47,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:47,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 463 states and 650 transitions. [2025-01-10 07:13:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states and 650 transitions. [2025-01-10 07:13:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 383. [2025-01-10 07:13:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 383 states have (on average 1.4255874673629243) internal successors, (546), 382 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 546 transitions. [2025-01-10 07:13:47,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 383 states and 546 transitions. [2025-01-10 07:13:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:13:47,646 INFO L432 stractBuchiCegarLoop]: Abstraction has 383 states and 546 transitions. [2025-01-10 07:13:47,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:13:47,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 546 transitions. [2025-01-10 07:13:47,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 347 [2025-01-10 07:13:47,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:47,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:47,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:47,648 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:47,648 INFO L754 eck$LassoCheckResult]: Loop: "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" [2025-01-10 07:13:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1154094120, now seen corresponding path program 7 times [2025-01-10 07:13:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498602495] [2025-01-10 07:13:47,649 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:13:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:47,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:13:47,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:13:47,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:47,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 287026071, now seen corresponding path program 1 times [2025-01-10 07:13:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115384108] [2025-01-10 07:13:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:47,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 07:13:47,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:13:47,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:13:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115384108] [2025-01-10 07:13:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115384108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837844132] [2025-01-10 07:13:47,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:47,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:47,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:13:47,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 07:13:47,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:13:47,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:47,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:47,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:13:47,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:47,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:13:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837844132] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:47,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 07:13:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65186992] [2025-01-10 07:13:47,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:47,890 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:47,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 07:13:47,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 07:13:47,891 INFO L87 Difference]: Start difference. First operand 383 states and 546 transitions. cyclomatic complexity: 165 Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:48,777 INFO L93 Difference]: Finished difference Result 526 states and 669 transitions. [2025-01-10 07:13:48,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 526 states and 669 transitions. [2025-01-10 07:13:48,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 439 [2025-01-10 07:13:48,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 526 states to 526 states and 669 transitions. [2025-01-10 07:13:48,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 526 [2025-01-10 07:13:48,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 526 [2025-01-10 07:13:48,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 526 states and 669 transitions. [2025-01-10 07:13:48,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:48,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 526 states and 669 transitions. [2025-01-10 07:13:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 669 transitions. [2025-01-10 07:13:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 317. [2025-01-10 07:13:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 317 states have (on average 1.2996845425867507) internal successors, (412), 316 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 412 transitions. [2025-01-10 07:13:48,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 317 states and 412 transitions. [2025-01-10 07:13:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-10 07:13:48,792 INFO L432 stractBuchiCegarLoop]: Abstraction has 317 states and 412 transitions. [2025-01-10 07:13:48,792 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-01-10 07:13:48,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 412 transitions. [2025-01-10 07:13:48,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 267 [2025-01-10 07:13:48,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:48,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:48,794 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] [2025-01-10 07:13:48,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:48,794 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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;" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:48,795 INFO L754 eck$LassoCheckResult]: Loop: "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255);" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1286802231, now seen corresponding path program 1 times [2025-01-10 07:13:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627486163] [2025-01-10 07:13:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:48,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:13:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:13:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:48,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627486163] [2025-01-10 07:13:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627486163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:48,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:48,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:13:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726606640] [2025-01-10 07:13:48,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:48,893 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1841586647, now seen corresponding path program 1 times [2025-01-10 07:13:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446474026] [2025-01-10 07:13:48,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:48,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:48,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:48,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446474026] [2025-01-10 07:13:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446474026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468530061] [2025-01-10 07:13:48,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:48,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:48,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:48,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 07:13:48,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:48,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:48,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:13:48,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 07:13:49,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:13:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468530061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:13:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-10 07:13:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278872639] [2025-01-10 07:13:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:49,017 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:49,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:13:49,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:13:49,017 INFO L87 Difference]: Start difference. First operand 317 states and 412 transitions. cyclomatic complexity: 97 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) [2025-01-10 07:13:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:49,355 INFO L93 Difference]: Finished difference Result 1130 states and 1482 transitions. [2025-01-10 07:13:49,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1130 states and 1482 transitions. [2025-01-10 07:13:49,360 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 987 [2025-01-10 07:13:49,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1130 states to 1130 states and 1482 transitions. [2025-01-10 07:13:49,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1130 [2025-01-10 07:13:49,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1130 [2025-01-10 07:13:49,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1130 states and 1482 transitions. [2025-01-10 07:13:49,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:49,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1130 states and 1482 transitions. [2025-01-10 07:13:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states and 1482 transitions. [2025-01-10 07:13:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 308. [2025-01-10 07:13:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.3051948051948052) internal successors, (402), 307 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 402 transitions. [2025-01-10 07:13:49,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 402 transitions. [2025-01-10 07:13:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:13:49,383 INFO L432 stractBuchiCegarLoop]: Abstraction has 308 states and 402 transitions. [2025-01-10 07:13:49,384 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-01-10 07:13:49,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 402 transitions. [2025-01-10 07:13:49,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 267 [2025-01-10 07:13:49,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:49,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:49,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:49,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:49,386 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" [2025-01-10 07:13:49,386 INFO L754 eck$LassoCheckResult]: Loop: "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255);" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" [2025-01-10 07:13:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 430306745, now seen corresponding path program 1 times [2025-01-10 07:13:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074740708] [2025-01-10 07:13:49,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:49,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:13:49,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:13:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074740708] [2025-01-10 07:13:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074740708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696520893] [2025-01-10 07:13:49,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:49,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:49,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 07:13:49,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:13:49,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:13:49,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:13:49,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:49,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:13:49,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696520893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:49,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:13:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-10 07:13:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139855826] [2025-01-10 07:13:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:49,600 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -38226647, now seen corresponding path program 1 times [2025-01-10 07:13:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31387549] [2025-01-10 07:13:49,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:49,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:49,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:49,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 07:13:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31387549] [2025-01-10 07:13:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31387549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238374785] [2025-01-10 07:13:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:49,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:49,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 07:13:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:49,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:49,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:13:49,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:13:49,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:13:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238374785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:49,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:13:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-10 07:13:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626847448] [2025-01-10 07:13:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:49,753 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:49,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:49,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:13:49,754 INFO L87 Difference]: Start difference. First operand 308 states and 402 transitions. cyclomatic complexity: 96 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2025-01-10 07:13:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:49,836 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2025-01-10 07:13:49,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 422 transitions. [2025-01-10 07:13:49,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 267 [2025-01-10 07:13:49,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 327 states and 422 transitions. [2025-01-10 07:13:49,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-01-10 07:13:49,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2025-01-10 07:13:49,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 422 transitions. [2025-01-10 07:13:49,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:49,839 INFO L218 hiAutomatonCegarLoop]: Abstraction has 327 states and 422 transitions. [2025-01-10 07:13:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 422 transitions. [2025-01-10 07:13:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 305. [2025-01-10 07:13:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 305 states have (on average 1.301639344262295) internal successors, (397), 304 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 397 transitions. [2025-01-10 07:13:49,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 305 states and 397 transitions. [2025-01-10 07:13:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:13:49,845 INFO L432 stractBuchiCegarLoop]: Abstraction has 305 states and 397 transitions. [2025-01-10 07:13:49,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-01-10 07:13:49,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 397 transitions. [2025-01-10 07:13:49,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 267 [2025-01-10 07:13:49,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:49,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:49,848 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] [2025-01-10 07:13:49,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:49,848 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:49,848 INFO L754 eck$LassoCheckResult]: Loop: "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "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) > 255;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;" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 454580696, now seen corresponding path program 1 times [2025-01-10 07:13:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150990848] [2025-01-10 07:13:49,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:49,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:49,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:49,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:49,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:49,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:49,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:49,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:49,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1910486049, now seen corresponding path program 1 times [2025-01-10 07:13:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226791092] [2025-01-10 07:13:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:49,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226791092] [2025-01-10 07:13:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226791092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241738552] [2025-01-10 07:13:49,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:49,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:49,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:49,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 07:13:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:13:49,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:13:49,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:49,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:13:49,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 07:13:50,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 07:13:50,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241738552] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:50,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 07:13:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2025-01-10 07:13:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705070128] [2025-01-10 07:13:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:50,115 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:50,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:13:50,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:13:50,116 INFO L87 Difference]: Start difference. First operand 305 states and 397 transitions. cyclomatic complexity: 94 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:50,302 INFO L93 Difference]: Finished difference Result 620 states and 807 transitions. [2025-01-10 07:13:50,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 620 states and 807 transitions. [2025-01-10 07:13:50,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 563 [2025-01-10 07:13:50,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 620 states to 611 states and 797 transitions. [2025-01-10 07:13:50,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 611 [2025-01-10 07:13:50,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 611 [2025-01-10 07:13:50,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 611 states and 797 transitions. [2025-01-10 07:13:50,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:50,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 611 states and 797 transitions. [2025-01-10 07:13:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states and 797 transitions. [2025-01-10 07:13:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 533. [2025-01-10 07:13:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 533 states have (on average 1.3170731707317074) internal successors, (702), 532 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 702 transitions. [2025-01-10 07:13:50,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 533 states and 702 transitions. [2025-01-10 07:13:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:13:50,316 INFO L432 stractBuchiCegarLoop]: Abstraction has 533 states and 702 transitions. [2025-01-10 07:13:50,316 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-01-10 07:13:50,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 702 transitions. [2025-01-10 07:13:50,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 495 [2025-01-10 07:13:50,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:50,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:50,318 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] [2025-01-10 07:13:50,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:50,318 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:50,319 INFO L754 eck$LassoCheckResult]: Loop: "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 454580696, now seen corresponding path program 2 times [2025-01-10 07:13:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376603909] [2025-01-10 07:13:50,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:50,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 07:13:50,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:50,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:13:50,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:50,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:50,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:50,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:50,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:50,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:50,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash 684136009, now seen corresponding path program 1 times [2025-01-10 07:13:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:50,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237072012] [2025-01-10 07:13:50,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:50,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 07:13:50,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 07:13:50,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:50,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237072012] [2025-01-10 07:13:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237072012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:50,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:13:50,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:13:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384703474] [2025-01-10 07:13:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:50,461 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:50,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:13:50,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:13:50,462 INFO L87 Difference]: Start difference. First operand 533 states and 702 transitions. cyclomatic complexity: 172 Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:50,687 INFO L93 Difference]: Finished difference Result 833 states and 1074 transitions. [2025-01-10 07:13:50,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 833 states and 1074 transitions. [2025-01-10 07:13:50,690 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 706 [2025-01-10 07:13:50,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 833 states to 824 states and 1065 transitions. [2025-01-10 07:13:50,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 824 [2025-01-10 07:13:50,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 824 [2025-01-10 07:13:50,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 824 states and 1065 transitions. [2025-01-10 07:13:50,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:50,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 824 states and 1065 transitions. [2025-01-10 07:13:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states and 1065 transitions. [2025-01-10 07:13:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 723. [2025-01-10 07:13:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 723 states have (on average 1.3167358229598893) internal successors, (952), 722 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 952 transitions. [2025-01-10 07:13:50,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 723 states and 952 transitions. [2025-01-10 07:13:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:13:50,707 INFO L432 stractBuchiCegarLoop]: Abstraction has 723 states and 952 transitions. [2025-01-10 07:13:50,707 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-01-10 07:13:50,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 723 states and 952 transitions. [2025-01-10 07:13:50,709 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 653 [2025-01-10 07:13:50,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:50,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:50,710 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] [2025-01-10 07:13:50,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:50,710 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:50,710 INFO L754 eck$LassoCheckResult]: Loop: "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:50,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 454580696, now seen corresponding path program 3 times [2025-01-10 07:13:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:50,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028230418] [2025-01-10 07:13:50,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:50,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-10 07:13:50,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:50,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 07:13:50,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:50,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:50,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:50,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:50,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:50,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:50,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:50,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 34253883, now seen corresponding path program 1 times [2025-01-10 07:13:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871525780] [2025-01-10 07:13:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:50,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:13:50,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:13:50,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:50,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871525780] [2025-01-10 07:13:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871525780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922939761] [2025-01-10 07:13:50,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:50,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:50,814 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:50,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 07:13:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:13:50,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:13:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:50,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:13:50,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 07:13:50,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:13:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922939761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:13:50,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:13:50,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-10 07:13:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681398717] [2025-01-10 07:13:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:13:50,887 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:50,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:50,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:13:50,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:13:50,887 INFO L87 Difference]: Start difference. First operand 723 states and 952 transitions. cyclomatic complexity: 235 Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:50,982 INFO L93 Difference]: Finished difference Result 851 states and 1058 transitions. [2025-01-10 07:13:50,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 851 states and 1058 transitions. [2025-01-10 07:13:50,985 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 737 [2025-01-10 07:13:50,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 851 states to 799 states and 972 transitions. [2025-01-10 07:13:50,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2025-01-10 07:13:50,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2025-01-10 07:13:50,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 799 states and 972 transitions. [2025-01-10 07:13:50,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:50,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 799 states and 972 transitions. [2025-01-10 07:13:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states and 972 transitions. [2025-01-10 07:13:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 640. [2025-01-10 07:13:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 640 states have (on average 1.25) internal successors, (800), 639 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 800 transitions. [2025-01-10 07:13:50,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 640 states and 800 transitions. [2025-01-10 07:13:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:13:51,000 INFO L432 stractBuchiCegarLoop]: Abstraction has 640 states and 800 transitions. [2025-01-10 07:13:51,000 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-01-10 07:13:51,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 640 states and 800 transitions. [2025-01-10 07:13:51,002 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 583 [2025-01-10 07:13:51,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:51,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:51,002 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] [2025-01-10 07:13:51,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:51,003 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255);" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:51,003 INFO L754 eck$LassoCheckResult]: Loop: "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "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) > 255;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;" "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));" "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));" "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));" "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;" "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" [2025-01-10 07:13:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 61553686, now seen corresponding path program 1 times [2025-01-10 07:13:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146060454] [2025-01-10 07:13:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:51,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:51,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:51,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:51,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:51,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:51,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:13:51,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:13:51,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:51,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:51,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1955841333, now seen corresponding path program 1 times [2025-01-10 07:13:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320982895] [2025-01-10 07:13:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 07:13:51,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 07:13:51,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:51,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320982895] [2025-01-10 07:13:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320982895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100378595] [2025-01-10 07:13:51,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:51,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:51,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:51,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:51,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 07:13:51,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 07:13:51,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 07:13:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:51,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:13:51,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 07:13:51,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 07:13:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100378595] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:51,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:51,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 07:13:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126561702] [2025-01-10 07:13:51,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:51,340 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:13:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 07:13:51,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-10 07:13:51,341 INFO L87 Difference]: Start difference. First operand 640 states and 800 transitions. cyclomatic complexity: 167 Second operand has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:52,233 INFO L93 Difference]: Finished difference Result 673 states and 742 transitions. [2025-01-10 07:13:52,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 742 transitions. [2025-01-10 07:13:52,236 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 124 [2025-01-10 07:13:52,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 668 states and 728 transitions. [2025-01-10 07:13:52,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 668 [2025-01-10 07:13:52,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 668 [2025-01-10 07:13:52,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 668 states and 728 transitions. [2025-01-10 07:13:52,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:52,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 668 states and 728 transitions. [2025-01-10 07:13:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states and 728 transitions. [2025-01-10 07:13:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 362. [2025-01-10 07:13:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 362 states have (on average 1.1077348066298343) internal successors, (401), 361 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 401 transitions. [2025-01-10 07:13:52,248 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 401 transitions. [2025-01-10 07:13:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 07:13:52,249 INFO L432 stractBuchiCegarLoop]: Abstraction has 362 states and 401 transitions. [2025-01-10 07:13:52,249 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-01-10 07:13:52,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 401 transitions. [2025-01-10 07:13:52,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2025-01-10 07:13:52,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:52,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:52,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:52,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:52,253 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:13:52,253 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:13:52,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1160914035, now seen corresponding path program 1 times [2025-01-10 07:13:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173671358] [2025-01-10 07:13:52,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 07:13:52,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 07:13:52,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:52,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 07:13:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173671358] [2025-01-10 07:13:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173671358] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604580853] [2025-01-10 07:13:52,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:52,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:52,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:52,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:52,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 07:13:52,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 07:13:52,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 07:13:52,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:52,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:52,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:13:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:13:52,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:13:52,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604580853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:52,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 07:13:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311153320] [2025-01-10 07:13:52,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:52,455 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:52,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 998513923, now seen corresponding path program 1 times [2025-01-10 07:13:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241878212] [2025-01-10 07:13:52,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:52,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:52,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:52,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:52,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:52,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:52,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:52,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:52,546 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:52,547 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:52,547 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:52,547 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:52,547 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:13:52,547 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:52,547 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:52,547 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:52,547 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration21_Loop [2025-01-10 07:13:52,547 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:52,547 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:52,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:52,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:52,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:52,787 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:13:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:52,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:52,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:13:52,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:52,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:52,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:52,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:52,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:52,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:52,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:13:52,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:13:52,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:53,254 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:13:53,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:13:53,264 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:53,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:53,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:53,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:53,264 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:13:53,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:53,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:53,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration21_Loop [2025-01-10 07:13:53,266 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:53,266 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:53,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:53,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:53,436 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:53,439 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:13:53,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,442 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:13:53,444 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 [2025-01-10 07:13:53,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:53,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:53,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:13:53,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,472 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:13:53,473 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 [2025-01-10 07:13:53,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:53,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:53,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:13:53,497 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:13:53,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,499 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:13:53,501 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 [2025-01-10 07:13:53,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,511 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:53,513 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:53,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:13:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,523 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:13:53,525 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 [2025-01-10 07:13:53,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,535 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:53,538 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:53,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,548 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:13:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:13:53,552 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 [2025-01-10 07:13:53,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,563 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,565 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,576 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:13:53,579 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 [2025-01-10 07:13:53,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,590 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,594 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,606 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:13:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,608 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:13:53,610 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 [2025-01-10 07:13:53,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,622 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:53,624 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:53,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,634 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:13:53,637 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 [2025-01-10 07:13:53,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:53,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,648 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:53,652 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:53,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:13:53,668 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:13:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,670 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:13:53,673 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 [2025-01-10 07:13:53,684 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,684 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:53,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,684 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:53,686 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:53,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:13:53,702 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 [2025-01-10 07:13:53,712 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,712 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:53,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,713 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:53,717 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:53,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:13:53,729 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:13:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,730 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:13:53,732 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 [2025-01-10 07:13:53,742 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,742 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:53,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,742 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,745 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:13:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,759 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:13:53,760 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 [2025-01-10 07:13:53,770 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,770 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:53,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,771 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,775 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:13:53,791 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:13:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,794 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:13:53,797 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 [2025-01-10 07:13:53,808 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,809 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:53,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,809 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:53,812 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:53,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:13:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,830 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:13:53,836 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 [2025-01-10 07:13:53,847 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,848 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:53,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,848 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:53,854 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:53,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:13:53,872 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:13:53,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,874 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:13:53,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 [2025-01-10 07:13:53,887 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,887 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:53,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,887 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,889 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:13:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,900 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:13:53,902 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 [2025-01-10 07:13:53,912 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,912 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:53,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,912 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:53,916 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:53,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-01-10 07:13:53,927 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:13:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,929 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:13:53,931 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 [2025-01-10 07:13:53,941 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,941 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:53,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,941 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:53,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:53,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:53,960 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:53,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 07:13:53,963 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 [2025-01-10 07:13:53,974 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:53,975 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:53,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:53,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:53,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:53,975 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:53,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:53,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:53,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:53,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:53,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:13:53,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:13:53,999 INFO L87 Difference]: Start difference. First operand 362 states and 401 transitions. cyclomatic complexity: 41 Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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) [2025-01-10 07:13:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:54,555 INFO L93 Difference]: Finished difference Result 562 states and 611 transitions. [2025-01-10 07:13:54,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 611 transitions. [2025-01-10 07:13:54,557 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 110 [2025-01-10 07:13:54,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 538 states and 585 transitions. [2025-01-10 07:13:54,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2025-01-10 07:13:54,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 538 [2025-01-10 07:13:54,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 538 states and 585 transitions. [2025-01-10 07:13:54,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:54,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 538 states and 585 transitions. [2025-01-10 07:13:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 585 transitions. [2025-01-10 07:13:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 403. [2025-01-10 07:13:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 403 states have (on average 1.1042183622828785) internal successors, (445), 402 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 445 transitions. [2025-01-10 07:13:54,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 403 states and 445 transitions. [2025-01-10 07:13:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 07:13:54,565 INFO L432 stractBuchiCegarLoop]: Abstraction has 403 states and 445 transitions. [2025-01-10 07:13:54,565 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-01-10 07:13:54,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 445 transitions. [2025-01-10 07:13:54,566 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2025-01-10 07:13:54,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:54,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:54,567 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] [2025-01-10 07:13:54,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:54,567 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:13:54,567 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:13:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 718665893, now seen corresponding path program 1 times [2025-01-10 07:13:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510020511] [2025-01-10 07:13:54,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:54,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 07:13:54,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 07:13:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 07:13:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510020511] [2025-01-10 07:13:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510020511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356979089] [2025-01-10 07:13:54,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:54,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:54,679 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:54,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-10 07:13:54,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 07:13:54,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 07:13:54,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:54,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:54,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:13:54,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 07:13:54,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 07:13:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356979089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:54,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 13 [2025-01-10 07:13:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305168829] [2025-01-10 07:13:54,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:54,924 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1390393305, now seen corresponding path program 1 times [2025-01-10 07:13:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233008819] [2025-01-10 07:13:54,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:54,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:54,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:54,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:54,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:54,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:54,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:54,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:54,996 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:54,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:54,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:54,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:54,997 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:13:54,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:54,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:54,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:54,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2025-01-10 07:13:54,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:54,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:54,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:55,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:55,189 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:55,189 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:13:55,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,191 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:13:55,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:55,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:55,218 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:13:55,219 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: [] [2025-01-10 07:13:55,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:55,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,227 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 07:13:55,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:55,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:55,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:55,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,268 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:13:55,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:13:55,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:55,654 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:13:55,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-01-10 07:13:55,665 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:55,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:55,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:55,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:55,665 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:13:55,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:55,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:55,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2025-01-10 07:13:55,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:55,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:55,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:55,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:55,856 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:55,856 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:13:55,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,861 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:13:55,875 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 [2025-01-10 07:13:55,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:55,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:55,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:55,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:55,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:55,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:55,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:55,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:55,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:13:55,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,895 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:13:55,897 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 [2025-01-10 07:13:55,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:55,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:55,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:55,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:55,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:55,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:55,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:55,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:55,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:55,919 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:13:55,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,921 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 07:13:55,923 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 [2025-01-10 07:13:55,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:55,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:55,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:55,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:55,934 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:55,935 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:55,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:55,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:55,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 07:13:55,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,946 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 07:13:55,947 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 [2025-01-10 07:13:55,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:55,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:55,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:55,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:55,957 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:55,960 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:55,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:55,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:55,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-01-10 07:13:55,970 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:13:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,972 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 07:13:55,974 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 [2025-01-10 07:13:55,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:55,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:55,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:55,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:55,984 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:55,985 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:55,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:55,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:55,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-01-10 07:13:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:55,995 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:55,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 07:13:55,997 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 [2025-01-10 07:13:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:56,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,007 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:56,010 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:56,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-01-10 07:13:56,020 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:13:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,022 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 07:13:56,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 [2025-01-10 07:13:56,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:56,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,034 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:56,036 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:56,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,048 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 07:13:56,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 [2025-01-10 07:13:56,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:56,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,061 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:56,065 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:56,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-01-10 07:13:56,078 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:13:56,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,080 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 07:13:56,082 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 [2025-01-10 07:13:56,093 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,093 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:56,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,093 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:56,095 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:56,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-01-10 07:13:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,107 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 07:13:56,110 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 [2025-01-10 07:13:56,121 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,121 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:56,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,121 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:56,123 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:56,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-01-10 07:13:56,136 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:13:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,138 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:13:56,141 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 [2025-01-10 07:13:56,152 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,152 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:56,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,153 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:56,155 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:56,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:13:56,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,168 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:13:56,169 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 [2025-01-10 07:13:56,180 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:56,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,180 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:56,184 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:56,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:13:56,199 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:13:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,201 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:13:56,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 [2025-01-10 07:13:56,215 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,216 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:56,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,216 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:56,219 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:56,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,235 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:13:56,238 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 [2025-01-10 07:13:56,248 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,248 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:56,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,249 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:56,254 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:56,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,273 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:13:56,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,275 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:13:56,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 [2025-01-10 07:13:56,287 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,288 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:56,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,288 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:56,290 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:56,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,302 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:13:56,305 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 [2025-01-10 07:13:56,315 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,315 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:56,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,316 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:56,318 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:56,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,331 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:13:56,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,333 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:13:56,336 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 [2025-01-10 07:13:56,346 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,346 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:56,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,347 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:56,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:56,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:56,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,364 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 07:13:56,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 [2025-01-10 07:13:56,378 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:56,378 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:56,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:56,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:56,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:56,378 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:56,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:56,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:56,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:56,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:56,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:13:56,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:13:56,400 INFO L87 Difference]: Start difference. First operand 403 states and 445 transitions. cyclomatic complexity: 46 Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:56,821 INFO L93 Difference]: Finished difference Result 684 states and 731 transitions. [2025-01-10 07:13:56,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 684 states and 731 transitions. [2025-01-10 07:13:56,823 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 139 [2025-01-10 07:13:56,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 684 states to 640 states and 687 transitions. [2025-01-10 07:13:56,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 640 [2025-01-10 07:13:56,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 640 [2025-01-10 07:13:56,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 687 transitions. [2025-01-10 07:13:56,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:56,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 640 states and 687 transitions. [2025-01-10 07:13:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 687 transitions. [2025-01-10 07:13:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 426. [2025-01-10 07:13:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 426 states have (on average 1.0845070422535212) internal successors, (462), 425 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 462 transitions. [2025-01-10 07:13:56,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 426 states and 462 transitions. [2025-01-10 07:13:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 07:13:56,833 INFO L432 stractBuchiCegarLoop]: Abstraction has 426 states and 462 transitions. [2025-01-10 07:13:56,833 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-01-10 07:13:56,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 426 states and 462 transitions. [2025-01-10 07:13:56,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2025-01-10 07:13:56,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:56,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:56,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 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] [2025-01-10 07:13:56,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:56,835 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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;" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255;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;" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255;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;" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:13:56,835 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:13:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2090794789, now seen corresponding path program 1 times [2025-01-10 07:13:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510425037] [2025-01-10 07:13:56,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 07:13:56,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 07:13:56,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:56,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 07:13:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510425037] [2025-01-10 07:13:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510425037] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168987793] [2025-01-10 07:13:56,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:56,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:56,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:56,992 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:56,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-01-10 07:13:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 07:13:57,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 07:13:57,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:57,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:57,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 07:13:57,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 07:13:57,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 07:13:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168987793] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:57,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-01-10 07:13:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861003369] [2025-01-10 07:13:57,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:57,285 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1390393305, now seen corresponding path program 2 times [2025-01-10 07:13:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:57,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934033029] [2025-01-10 07:13:57,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:57,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:57,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:57,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:57,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:57,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:57,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:57,355 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:57,355 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:57,355 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:57,355 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:57,355 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:13:57,355 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:57,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:57,355 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:57,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2025-01-10 07:13:57,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:57,355 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:57,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:57,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:57,523 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:57,523 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:13:57,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:57,526 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:57,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:13:57,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:57,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:57,548 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:13:57,548 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: [] [2025-01-10 07:13:57,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:57,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:57,557 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:57,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 07:13:57,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:57,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:57,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:57,606 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:57,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 07:13:57,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:13:57,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:58,057 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:13:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,072 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:58,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:58,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:58,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:58,072 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:13:58,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:58,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:58,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2025-01-10 07:13:58,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:58,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:58,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:58,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:58,244 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:58,245 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:13:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,247 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 07:13:58,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 [2025-01-10 07:13:58,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:58,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:58,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,269 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-01-10 07:13:58,270 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 [2025-01-10 07:13:58,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:58,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:58,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-01-10 07:13:58,289 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:13:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,291 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 07:13:58,293 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 [2025-01-10 07:13:58,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,302 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:58,303 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:58,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-01-10 07:13:58,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,313 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 07:13:58,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 [2025-01-10 07:13:58,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,325 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:58,327 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:58,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-01-10 07:13:58,336 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:13:58,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,338 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 07:13:58,340 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 [2025-01-10 07:13:58,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,350 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,351 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-01-10 07:13:58,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,361 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 07:13:58,363 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 [2025-01-10 07:13:58,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,373 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,376 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-01-10 07:13:58,387 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:13:58,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,389 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 07:13:58,391 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 [2025-01-10 07:13:58,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,401 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:58,402 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:58,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-01-10 07:13:58,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,413 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 07:13:58,414 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 [2025-01-10 07:13:58,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:58,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,425 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:58,428 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:58,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,439 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:13:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,441 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 07:13:58,443 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 [2025-01-10 07:13:58,453 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,453 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:58,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,453 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:58,455 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:58,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,466 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 07:13:58,468 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 [2025-01-10 07:13:58,478 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,478 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:58,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,478 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:13:58,481 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:13:58,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-01-10 07:13:58,494 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:13:58,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,496 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-01-10 07:13:58,498 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 [2025-01-10 07:13:58,508 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,509 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:58,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,509 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,511 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,524 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 07:13:58,526 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 [2025-01-10 07:13:58,537 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,537 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:13:58,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,537 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,540 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,555 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:13:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,558 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 07:13:58,560 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 [2025-01-10 07:13:58,572 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,572 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:58,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,572 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:58,574 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:58,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,590 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-01-10 07:13:58,593 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 [2025-01-10 07:13:58,604 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,604 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:58,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,605 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:13:58,609 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:13:58,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-01-10 07:13:58,627 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:13:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,629 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-01-10 07:13:58,632 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 [2025-01-10 07:13:58,641 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,642 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:58,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,642 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,643 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,655 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-01-10 07:13:58,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 [2025-01-10 07:13:58,667 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,667 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:13:58,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,667 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:13:58,670 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:13:58,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-01-10 07:13:58,681 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:13:58,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,683 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-01-10 07:13:58,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 [2025-01-10 07:13:58,696 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,696 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:58,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,696 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:58,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:58,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-01-10 07:13:58,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:58,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:58,712 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:58,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-01-10 07:13:58,715 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 [2025-01-10 07:13:58,726 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:13:58,726 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:13:58,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:58,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:58,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:58,726 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:13:58,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:58,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:58,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:58,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 07:13:58,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 07:13:58,747 INFO L87 Difference]: Start difference. First operand 426 states and 462 transitions. cyclomatic complexity: 40 Second operand has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:58,969 INFO L93 Difference]: Finished difference Result 524 states and 558 transitions. [2025-01-10 07:13:58,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 558 transitions. [2025-01-10 07:13:58,971 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2025-01-10 07:13:58,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 524 states and 558 transitions. [2025-01-10 07:13:58,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2025-01-10 07:13:58,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2025-01-10 07:13:58,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 524 states and 558 transitions. [2025-01-10 07:13:58,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:58,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 524 states and 558 transitions. [2025-01-10 07:13:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states and 558 transitions. [2025-01-10 07:13:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 356. [2025-01-10 07:13:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 1.0814606741573034) internal successors, (385), 355 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 385 transitions. [2025-01-10 07:13:58,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 356 states and 385 transitions. [2025-01-10 07:13:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:13:58,979 INFO L432 stractBuchiCegarLoop]: Abstraction has 356 states and 385 transitions. [2025-01-10 07:13:58,979 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-01-10 07:13:58,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 385 transitions. [2025-01-10 07:13:58,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2025-01-10 07:13:58,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:58,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:58,980 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] [2025-01-10 07:13:58,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:58,980 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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;" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255);" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:13:58,981 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:13:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1137760167, now seen corresponding path program 1 times [2025-01-10 07:13:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383437336] [2025-01-10 07:13:58,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:13:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:58,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 07:13:58,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 07:13:58,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:58,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:58,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:58,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 07:13:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 07:13:59,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:59,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:59,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1390393305, now seen corresponding path program 3 times [2025-01-10 07:13:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23927289] [2025-01-10 07:13:59,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:59,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:59,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:59,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:13:59,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:59,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:13:59,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:13:59,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:59,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:59,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1055953201, now seen corresponding path program 2 times [2025-01-10 07:13:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578879337] [2025-01-10 07:13:59,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:59,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-10 07:13:59,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 76 statements. [2025-01-10 07:13:59,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:59,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-10 07:13:59,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578879337] [2025-01-10 07:13:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578879337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299683275] [2025-01-10 07:13:59,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:13:59,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:59,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:59,112 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:13:59,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-01-10 07:13:59,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-10 07:13:59,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 76 statements. [2025-01-10 07:13:59,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:59,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:59,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:13:59,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-10 07:13:59,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-10 07:13:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299683275] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:59,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2025-01-10 07:13:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086989007] [2025-01-10 07:13:59,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:59,411 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:59,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:59,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:59,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:59,411 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:13:59,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:59,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:59,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:59,411 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2025-01-10 07:13:59,411 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:59,411 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:59,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:59,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:59,602 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:59,602 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:13:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:59,605 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:59,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-01-10 07:13:59,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:13:59,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:13:59,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:59,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:59,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:59,653 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:13:59,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-01-10 07:13:59,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:13:59,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:14:00,041 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:14:00,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,051 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:14:00,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:14:00,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:14:00,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:14:00,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:14:00,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:14:00,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:14:00,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2025-01-10 07:14:00,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:14:00,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:14:00,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:00,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:00,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:14:00,183 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:14:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,185 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-01-10 07:14:00,187 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 [2025-01-10 07:14:00,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:00,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:00,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-01-10 07:14:00,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,210 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-01-10 07:14: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 [2025-01-10 07:14:00,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:00,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:00,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-01-10 07:14:00,234 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:14:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,236 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-01-10 07:14:00,239 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 [2025-01-10 07:14:00,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,249 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:00,252 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:00,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,264 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-01-10 07:14:00,266 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 [2025-01-10 07:14:00,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,277 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:00,278 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:00,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,286 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:14:00,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,288 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-01-10 07:14:00,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:14:00,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,302 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,304 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,316 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-01-10 07:14:00,318 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 [2025-01-10 07:14:00,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,328 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,329 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-01-10 07:14:00,337 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:14:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,339 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-01-10 07:14:00,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 [2025-01-10 07:14:00,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,351 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:00,355 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:00,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-01-10 07:14:00,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,367 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-01-10 07:14:00,369 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 [2025-01-10 07:14:00,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:00,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,379 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:00,380 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:00,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-01-10 07:14:00,389 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:14:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,391 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-01-10 07:14:00,392 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 [2025-01-10 07:14:00,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,402 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:00,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,402 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:00,404 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:00,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,417 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-01-10 07:14:00,419 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 [2025-01-10 07:14:00,429 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,429 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:00,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,429 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:00,430 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:00,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-01-10 07:14:00,439 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:14:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,441 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-01-10 07:14:00,442 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 [2025-01-10 07:14:00,452 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,452 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:00,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,452 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,455 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-01-10 07:14:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,472 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-01-10 07:14:00,473 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 [2025-01-10 07:14:00,483 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,483 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:00,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,483 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,485 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,495 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:14:00,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,496 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-01-10 07:14:00,498 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 [2025-01-10 07:14:00,508 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,508 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:00,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,508 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:00,512 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:00,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-01-10 07:14:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,531 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-01-10 07:14:00,532 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 [2025-01-10 07:14:00,542 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,543 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:00,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,543 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:00,548 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:00,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-01-10 07:14:00,561 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:14:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,563 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-01-10 07:14:00,566 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 [2025-01-10 07:14:00,576 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,576 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:00,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,576 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,579 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,594 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-01-10 07:14:00,596 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 [2025-01-10 07:14:00,607 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,607 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:00,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,607 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:00,609 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:00,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,618 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:14:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,620 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-01-10 07:14:00,623 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 [2025-01-10 07:14:00,633 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,633 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:00,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,634 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:00,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:00,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:00,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:00,655 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:00,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-01-10 07:14:00,658 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 [2025-01-10 07:14:00,668 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:00,668 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:00,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:00,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:00,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:00,668 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:00,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:00,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:00,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:00,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:14:00,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:14:00,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:14:00,682 INFO L87 Difference]: Start difference. First operand 356 states and 385 transitions. cyclomatic complexity: 33 Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:14:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:14:00,789 INFO L93 Difference]: Finished difference Result 342 states and 365 transitions. [2025-01-10 07:14:00,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 365 transitions. [2025-01-10 07:14:00,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-01-10 07:14:00,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 109 states and 115 transitions. [2025-01-10 07:14:00,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2025-01-10 07:14:00,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-01-10 07:14:00,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 115 transitions. [2025-01-10 07:14:00,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:14:00,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 115 transitions. [2025-01-10 07:14:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 115 transitions. [2025-01-10 07:14:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2025-01-10 07:14:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0625) internal successors, (102), 95 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) [2025-01-10 07:14:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-01-10 07:14:00,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-01-10 07:14:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:14:00,793 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-01-10 07:14:00,793 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-01-10 07:14:00,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 102 transitions. [2025-01-10 07:14:00,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-01-10 07:14:00,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:14:00,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:14:00,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 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] [2025-01-10 07:14:00,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:14:00,793 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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;" "mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255);" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255);" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:14:00,794 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:14:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:14:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1506824493, now seen corresponding path program 1 times [2025-01-10 07:14:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:14:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819436212] [2025-01-10 07:14:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:14:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:14:00,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 07:14:00,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 07:14:00,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:00,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:14:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 07:14:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:14:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819436212] [2025-01-10 07:14:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819436212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:14:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086831558] [2025-01-10 07:14:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:14:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:14:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:01,077 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:14:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-01-10 07:14:01,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 07:14:01,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 07:14:01,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:01,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:14:01,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:14:01,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:14:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-10 07:14:01,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:14:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086831558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:14:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:14:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2025-01-10 07:14:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665945467] [2025-01-10 07:14:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:14:01,269 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:14:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:14:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 998513923, now seen corresponding path program 2 times [2025-01-10 07:14:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:14:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772952698] [2025-01-10 07:14:01,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:14:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:14:01,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:14:01,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:14:01,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:14:01,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:14:01,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:14:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:14:01,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:14:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:14:01,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:14:01,337 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:14:01,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:14:01,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:14:01,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:14:01,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:14:01,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:01,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:14:01,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:14:01,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2025-01-10 07:14:01,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:14:01,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:14:01,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:01,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:01,516 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:14:01,517 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:14:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:01,519 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:01,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-01-10 07:14:01,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:14:01,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:14:01,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:01,569 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-01-10 07:14:01,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:14:01,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:14:02,074 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:14:02,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:02,087 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:14:02,087 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:14:02,087 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:14:02,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:14:02,087 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:14:02,087 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,087 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:14:02,087 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:14:02,087 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2025-01-10 07:14:02,087 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:14:02,087 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:14:02,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:02,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:02,243 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:14:02,243 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:14:02,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,245 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-01-10 07:14:02,247 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 [2025-01-10 07:14:02,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:02,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:02,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:02,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,268 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-01-10 07:14:02,270 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 [2025-01-10 07:14:02,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:02,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:02,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-01-10 07:14:02,288 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:14:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,291 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-01-10 07:14:02,292 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 [2025-01-10 07:14:02,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,304 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:02,307 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:02,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-01-10 07:14:02,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,318 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-01-10 07:14:02,320 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 [2025-01-10 07:14:02,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,331 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:02,332 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:02,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:02,340 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:14:02,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,342 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-01-10 07:14:02,344 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 [2025-01-10 07:14:02,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,356 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,359 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-01-10 07:14:02,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,372 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-01-10 07:14:02,373 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 [2025-01-10 07:14:02,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,384 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,386 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-01-10 07:14:02,395 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:14:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,397 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-01-10 07:14:02,399 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 [2025-01-10 07:14:02,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,409 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:02,413 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:02,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-01-10 07:14:02,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,427 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-01-10 07:14:02,429 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 [2025-01-10 07:14:02,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:02,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,441 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:02,443 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:02,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:02,452 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:14:02,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,454 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-01-10 07:14:02,456 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 [2025-01-10 07:14:02,466 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,466 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:02,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,466 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:02,469 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:02,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-01-10 07:14:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,484 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-01-10 07:14:02,486 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 [2025-01-10 07:14:02,496 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,496 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:02,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,496 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:02,498 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:02,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-01-10 07:14:02,509 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:14:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,511 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-01-10 07:14:02,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:14:02,524 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,524 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:02,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,524 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,527 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-01-10 07:14:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,543 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-01-10 07:14:02,544 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 [2025-01-10 07:14:02,554 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,554 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:02,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,555 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,557 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-01-10 07:14:02,568 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:14:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,569 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-01-10 07:14:02,575 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 [2025-01-10 07:14:02,585 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,586 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:02,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,586 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:02,592 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:02,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-01-10 07:14:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,612 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-01-10 07:14:02,614 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 [2025-01-10 07:14:02,624 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,624 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:02,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,624 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:02,627 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:02,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-01-10 07:14:02,639 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:14:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,641 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-01-10 07:14:02,643 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 [2025-01-10 07:14:02,653 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,653 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:02,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,653 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,656 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-01-10 07:14:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,670 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-01-10 07:14:02,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 [2025-01-10 07:14:02,681 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,681 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:02,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,681 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:02,683 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:02,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-01-10 07:14:02,693 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:14:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,695 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-01-10 07:14:02,697 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 [2025-01-10 07:14:02,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,707 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:02,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,707 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:02,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:02,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-01-10 07:14:02,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:02,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:02,728 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:02,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-01-10 07:14:02,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 [2025-01-10 07:14:02,740 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:02,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:02,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:02,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:02,741 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:02,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:02,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:02,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:02,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-01-10 07:14:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:14:02,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:14:02,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-10 07:14:02,756 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:14:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:14:02,821 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2025-01-10 07:14:02,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 163 transitions. [2025-01-10 07:14:02,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-01-10 07:14:02,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 96 states and 101 transitions. [2025-01-10 07:14:02,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-01-10 07:14:02,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-01-10 07:14:02,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 101 transitions. [2025-01-10 07:14:02,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:14:02,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 101 transitions. [2025-01-10 07:14:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 101 transitions. [2025-01-10 07:14:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-10 07:14:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:14:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2025-01-10 07:14:02,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 101 transitions. [2025-01-10 07:14:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:14:02,825 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 101 transitions. [2025-01-10 07:14:02,825 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-01-10 07:14:02,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 101 transitions. [2025-01-10 07:14:02,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-01-10 07:14:02,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:14:02,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:14:02,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 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] [2025-01-10 07:14:02,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:14:02,826 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#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_~b~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~a~0#1 := 234770789;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;" "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_~nb~0#1 := 4;" "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;" "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;" "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_~carry~0#1 := 0;mp_add_~i~0#1 := 0;" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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);" "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));" "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));" "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));" "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) > 255);" "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;" "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));" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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);" "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));" "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));" "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) > 255);" "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));" "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;" "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));" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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);" "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));" "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) > 255);" "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));" "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));" "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;" "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_~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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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);" "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) > 255);" "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));" "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));" "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));" "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;" [2025-01-10 07:14:02,827 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume ((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_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;" "assume !((if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~na~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~na~0#1 % 256 % 4294967296 else mp_add_~na~0#1 % 256 % 4294967296 - 4294967296));" "assume (if mp_add_~i~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~i~0#1 % 256 % 4294967296 else mp_add_~i~0#1 % 256 % 4294967296 - 4294967296) < (if mp_add_~nb~0#1 % 256 % 4294967296 <= 2147483647 then mp_add_~nb~0#1 % 256 % 4294967296 else mp_add_~nb~0#1 % 256 % 4294967296 - 4294967296);" "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));" "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));" "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));" "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));" "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) > 255);" "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));" "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));" "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));" "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));" [2025-01-10 07:14:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:14:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1014198319, now seen corresponding path program 1 times [2025-01-10 07:14:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:14:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921632176] [2025-01-10 07:14:02,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:14:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:14:02,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 07:14:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 07:14:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:14:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:14:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:14:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921632176] [2025-01-10 07:14:03,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921632176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:14:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92112571] [2025-01-10 07:14:03,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:14:03,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:14:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:03,069 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:14:03,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-01-10 07:14:03,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 07:14:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 07:14:03,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:03,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:14:03,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:14:03,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:14:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-10 07:14:03,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:14:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92112571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:14:03,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:14:03,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2025-01-10 07:14:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278534015] [2025-01-10 07:14:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:14:03,236 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:14:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:14:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 998513923, now seen corresponding path program 3 times [2025-01-10 07:14:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:14:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449308452] [2025-01-10 07:14:03,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:14:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:14:03,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:14:03,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:14:03,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:14:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:14:03,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:14:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:14:03,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:14:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:14:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:14:03,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:14:03,305 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:14:03,305 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:14:03,305 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:14:03,305 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:14:03,305 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:14:03,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:03,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:14:03,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:14:03,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2025-01-10 07:14:03,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:14:03,306 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:14:03,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:03,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:03,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:14:03,502 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:14:03,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:03,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:03,504 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-01-10 07:14:03,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:14:03,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:14:03,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-01-10 07:14:03,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:03,555 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:03,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-01-10 07:14:03,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:14:03,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:14:03,960 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:14:03,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:03,972 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:14:03,972 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:14:03,972 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:14:03,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:14:03,972 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:14:03,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:03,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:14:03,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:14:03,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2025-01-10 07:14:03,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:14:03,972 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:14:03,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:03,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:14:04,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:14:04,115 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:14:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,117 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-01-10 07:14:04,118 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 [2025-01-10 07:14:04,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:04,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:04,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-01-10 07:14:04,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,139 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-01-10 07:14:04,141 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 [2025-01-10 07:14:04,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:14:04,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:14:04,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-01-10 07:14:04,160 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-01-10 07:14:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,162 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-01-10 07:14:04,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 [2025-01-10 07:14:04,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,174 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:04,175 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:04,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,184 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-01-10 07:14:04,185 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 [2025-01-10 07:14:04,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,196 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:04,198 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:04,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-01-10 07:14:04,207 INFO L451 LassoAnalysis]: Using template '3-nested'. [2025-01-10 07:14:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,209 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-01-10 07:14:04,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 [2025-01-10 07:14:04,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,221 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,222 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-01-10 07:14:04,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,232 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-01-10 07:14:04,233 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 [2025-01-10 07:14:04,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,243 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,247 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,257 INFO L451 LassoAnalysis]: Using template '4-nested'. [2025-01-10 07:14:04,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,259 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-01-10 07:14:04,260 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 [2025-01-10 07:14:04,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,270 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:04,272 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:04,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-01-10 07:14:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,283 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-01-10 07:14:04,285 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 [2025-01-10 07:14:04,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:14:04,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,296 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:04,299 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:04,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-01-10 07:14:04,310 INFO L451 LassoAnalysis]: Using template '2-phase'. [2025-01-10 07:14:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,312 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-01-10 07:14:04,319 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 [2025-01-10 07:14:04,330 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,330 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:04,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,330 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:04,331 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:04,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,343 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-01-10 07:14:04,344 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 [2025-01-10 07:14:04,355 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,355 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:04,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,355 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-01-10 07:14:04,357 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-01-10 07:14:04,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-01-10 07:14:04,368 INFO L451 LassoAnalysis]: Using template '3-phase'. [2025-01-10 07:14:04,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,370 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-01-10 07:14:04,371 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 [2025-01-10 07:14:04,381 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,381 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:04,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,381 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,383 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-01-10 07:14:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,396 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-01-10 07:14:04,397 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 [2025-01-10 07:14:04,408 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,408 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2025-01-10 07:14:04,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,408 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,411 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,426 INFO L451 LassoAnalysis]: Using template '4-phase'. [2025-01-10 07:14:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,428 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-01-10 07:14:04,429 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 [2025-01-10 07:14:04,439 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,439 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:04,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,439 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:04,442 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:04,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,456 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-01-10 07:14:04,458 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 [2025-01-10 07:14:04,468 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,468 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:04,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,468 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2025-01-10 07:14:04,472 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2025-01-10 07:14:04,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-01-10 07:14:04,489 INFO L451 LassoAnalysis]: Using template '2-lex'. [2025-01-10 07:14:04,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,491 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-01-10 07:14:04,493 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 [2025-01-10 07:14:04,503 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,503 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:04,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,504 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,505 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,516 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-01-10 07:14:04,518 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 [2025-01-10 07:14:04,528 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,528 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2025-01-10 07:14:04,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,528 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2025-01-10 07:14:04,531 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-01-10 07:14:04,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,542 INFO L451 LassoAnalysis]: Using template '3-lex'. [2025-01-10 07:14:04,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,544 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-01-10 07:14:04,546 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 [2025-01-10 07:14:04,556 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,556 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:04,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,556 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:04,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:04,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-01-10 07:14:04,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:14:04,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:14:04,572 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:14:04,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-01-10 07:14:04,573 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 [2025-01-10 07:14:04,584 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2025-01-10 07:14:04,584 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2025-01-10 07:14:04,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:14:04,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:14:04,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:14:04,584 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2025-01-10 07:14:04,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:14:04,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:14:04,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:14:04,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-01-10 07:14:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:14:04,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:14:04,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:14:04,606 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:14:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:14:04,638 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2025-01-10 07:14:04,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 68 transitions. [2025-01-10 07:14:04,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:14:04,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2025-01-10 07:14:04,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:14:04,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:14:04,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:14:04,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:14:04,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:14:04,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:14:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:14:04,639 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:14:04,639 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-01-10 07:14:04,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:14:04,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:14:04,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:14:04,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:14:04 BoogieIcfgContainer [2025-01-10 07:14:04,645 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:14:04,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:14:04,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:14:04,646 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:14:04,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:13:43" (3/4) ... [2025-01-10 07:14:04,648 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:14:04,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:14:04,649 INFO L158 Benchmark]: Toolchain (without parser) took 21565.21ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 130.4MB in the beginning and 114.6MB in the end (delta: 15.8MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. [2025-01-10 07:14:04,649 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:14:04,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 117.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:14:04,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:14:04,649 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:14:04,650 INFO L158 Benchmark]: RCFGBuilder took 347.96ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 90.9MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:14:04,650 INFO L158 Benchmark]: BuchiAutomizer took 20908.45ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 90.5MB in the beginning and 114.7MB in the end (delta: -24.1MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2025-01-10 07:14:04,650 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 293.6MB. Free memory was 114.7MB in the beginning and 114.6MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:14:04,651 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.94ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 117.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.96ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 90.9MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 20908.45ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 90.5MB in the beginning and 114.7MB in the end (delta: -24.1MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 293.6MB. Free memory was 114.7MB in the beginning and 114.6MB in the end (delta: 87.7kB). 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 26 terminating modules (26 trivial, 0 deterministic, 0 nondeterministic). 26 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.8s and 27 iterations. TraceHistogramMax:4. Analysis of lassos took 14.7s. Construction of modules took 3.4s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 0. Minimization of det autom 26. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 2886 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3971 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3971 mSDsluCounter, 3240 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 455 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5939 IncrementalHoareTripleChecker+Invalid, 6394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 455 mSolverCounterUnsat, 1130 mSDtfsCounter, 5939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI12 SFLT0 conc1 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: 25ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:14:04,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:05,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-01-10 07:14:05,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-01-10 07:14:05,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:05,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:05,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:06,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:06,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:06,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:06,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 07:14:06,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:07,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:14:07,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE