./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:05:34,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:05:34,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:05:34,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:05:34,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:05:34,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:05:35,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:05:35,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:05:35,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:05:35,000 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:05:35,000 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:05:35,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:05:35,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:05:35,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:05:35,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:05:35,002 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:05:35,002 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2025-01-10 07:05:35,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:05:35,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:05:35,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:05:35,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:05:35,222 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:05:35,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-01-10 07:05:36,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6f452052/47545357095648cc962b1f4f85819965/FLAG15ca58999 [2025-01-10 07:05:36,774 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:05:36,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-01-10 07:05:36,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6f452052/47545357095648cc962b1f4f85819965/FLAG15ca58999 [2025-01-10 07:05:37,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6f452052/47545357095648cc962b1f4f85819965 [2025-01-10 07:05:37,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:05:37,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:05:37,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:05:37,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:05:37,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:05:37,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496caa94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37, skipping insertion in model container [2025-01-10 07:05:37,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:05:37,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:05:37,297 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:05:37,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:05:37,352 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:05:37,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37 WrapperNode [2025-01-10 07:05:37,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:05:37,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:05:37,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:05:37,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:05:37,358 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:05:37" (1/1) ... [2025-01-10 07:05:37,364 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:05:37" (1/1) ... [2025-01-10 07:05:37,377 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2025-01-10 07:05:37,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:05:37,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:05:37,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:05:37,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:05:37,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,407 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [8, 10, 6, 6, 12]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 20 writes are split as follows [4, 6, 2, 2, 6]. [2025-01-10 07:05:37,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:05:37,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:05:37,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:05:37,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:05:37,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (1/1) ... [2025-01-10 07:05:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:37,453 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:05:37,464 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:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:05:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:05:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 07:05:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:05:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:05:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:05:37,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:05:37,567 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:05:37,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:05:37,730 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-10 07:05:37,730 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:05:37,737 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:05:37,738 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 07:05:37,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:05:37 BoogieIcfgContainer [2025-01-10 07:05:37,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:05:37,739 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:05:37,739 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:05:37,742 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:05:37,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:05:37,743 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:05:37" (1/3) ... [2025-01-10 07:05:37,743 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c718094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:05:37, skipping insertion in model container [2025-01-10 07:05:37,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:05:37,744 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:05:37" (2/3) ... [2025-01-10 07:05:37,744 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c718094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:05:37, skipping insertion in model container [2025-01-10 07:05:37,744 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:05:37,744 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:05:37" (3/3) ... [2025-01-10 07:05:37,745 INFO L363 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2025-01-10 07:05:37,773 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:05:37,773 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:05:37,773 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:05:37,773 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:05:37,773 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:05:37,773 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:05:37,773 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:05:37,774 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:05:37,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 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:05:37,791 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-01-10 07:05:37,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:37,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:37,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:05:37,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:05:37,797 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:05:37,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 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:05:37,799 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-01-10 07:05:37,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:37,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:37,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:05:37,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:05:37,805 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#1(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#3(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#4(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" [2025-01-10 07:05:37,806 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem8#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume f_#t~mem8#1 < f_#t~mem9#1;havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "call f_#t~mem10#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#4(2 * f_#t~mem10#1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem10#1;" [2025-01-10 07:05:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2025-01-10 07:05:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838228763] [2025-01-10 07:05:37,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:37,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:37,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:05:37,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:05:37,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:37,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:37,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:37,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:05:37,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:05:37,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:37,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 43793, now seen corresponding path program 1 times [2025-01-10 07:05:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466512685] [2025-01-10 07:05:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:05:38,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:05:38,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:05:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:05:38,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:38,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1804998154, now seen corresponding path program 1 times [2025-01-10 07:05:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39424154] [2025-01-10 07:05:38,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:05:38,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:05:38,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:38,472 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:05:38,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:05:38,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39424154] [2025-01-10 07:05:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39424154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:05:38,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:05:38,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:05:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198423332] [2025-01-10 07:05:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:05:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:05:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:05:38,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:05:38,576 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 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) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:05:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:05:38,644 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-01-10 07:05:38,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2025-01-10 07:05:38,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2025-01-10 07:05:38,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 33 states and 42 transitions. [2025-01-10 07:05:38,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-01-10 07:05:38,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-01-10 07:05:38,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2025-01-10 07:05:38,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:05:38,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-01-10 07:05:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2025-01-10 07:05:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2025-01-10 07:05:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-01-10 07:05:38,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-01-10 07:05:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:05:38,675 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-01-10 07:05:38,675 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:05:38,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-01-10 07:05:38,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:38,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:38,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:38,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:05:38,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:05:38,675 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#1(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#3(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#4(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "call f_#t~mem8#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" [2025-01-10 07:05:38,676 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem11#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume !f_#t~short13#1;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;" "havoc f_#t~nondet14#1;" "assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1;" [2025-01-10 07:05:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash 889509741, now seen corresponding path program 1 times [2025-01-10 07:05:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595077692] [2025-01-10 07:05:38,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:38,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:38,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:38,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:38,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash 54553413, now seen corresponding path program 1 times [2025-01-10 07:05:38,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818809876] [2025-01-10 07:05:38,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:38,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:38,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:38,760 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:05:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:05:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818809876] [2025-01-10 07:05:38,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818809876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:05:38,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:05:38,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:05:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634773948] [2025-01-10 07:05:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:05:38,762 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:05:38,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:05:38,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:05:38,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:05:38,762 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:05:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:05:38,783 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-01-10 07:05:38,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2025-01-10 07:05:38,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:38,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 24 transitions. [2025-01-10 07:05:38,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:05:38,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 07:05:38,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2025-01-10 07:05:38,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:05:38,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 07:05:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2025-01-10 07:05:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 07:05:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:05:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-10 07:05:38,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 07:05:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:05:38,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 07:05:38,789 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:05:38,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2025-01-10 07:05:38,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:38,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:38,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:38,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:05:38,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:05:38,790 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#1(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#3(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#4(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "call f_#t~mem8#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" [2025-01-10 07:05:38,790 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem11#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;" "havoc f_#t~nondet14#1;" "assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1;" [2025-01-10 07:05:38,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash 889509741, now seen corresponding path program 2 times [2025-01-10 07:05:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748200424] [2025-01-10 07:05:38,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:05:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:38,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:38,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:05:38,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:38,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 54493831, now seen corresponding path program 1 times [2025-01-10 07:05:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890002006] [2025-01-10 07:05:38,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:38,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:38,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:38,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:38,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -353079653, now seen corresponding path program 1 times [2025-01-10 07:05:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754967461] [2025-01-10 07:05:38,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:38,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:38,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:38,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:38,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:38,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:40,548 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:05:40,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:05:40,549 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:05:40,549 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:05:40,549 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:05:40,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:40,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:05:40,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:05:40,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2025-01-10 07:05:40,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:05:40,549 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:05:40,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:40,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:40,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:40,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:40,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:41,950 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:05:41,952 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:05:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:41,961 INFO L229 MonitoredProcess]: Starting monitored process 2 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:05:41,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:05:41,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:05:41,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:41,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:41,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:41,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:41,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:41,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:41,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:41,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:41,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:05:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:41,993 INFO L229 MonitoredProcess]: Starting monitored process 3 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:05:41,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:05:41,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:42,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:42,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:42,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:05:42,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,023 INFO L229 MonitoredProcess]: Starting monitored process 4 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:05:42,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:05:42,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:42,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:42,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:42,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:42,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,052 INFO L229 MonitoredProcess]: Starting monitored process 5 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:05:42,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:05:42,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,083 INFO L229 MonitoredProcess]: Starting monitored process 6 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:05:42,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:05:42,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:05:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,130 INFO L229 MonitoredProcess]: Starting monitored process 7 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:05:42,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:05:42,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:05:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,171 INFO L229 MonitoredProcess]: Starting monitored process 8 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:05:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:05:42,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,199 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:42,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:05:42,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:42,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:05:42,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,243 INFO L229 MonitoredProcess]: Starting monitored process 10 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:05:42,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:05:42,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:42,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:42,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:42,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:42,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:42,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:42,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:42,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:05:42,287 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-01-10 07:05:42,290 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:05:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:42,293 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:05:42,295 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:05:42,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:05:42,310 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-01-10 07:05:42,311 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:05:42,311 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_f_~y~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_f_~y~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_1 - 1 >= 0] [2025-01-10 07:05:42,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:05:42,693 INFO L156 tatePredicateManager]: 54 out of 56 supporting invariants were superfluous and have been removed [2025-01-10 07:05:42,707 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:05:42,708 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:05:42,708 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-01-10 07:05:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:42,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:42,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:42,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:42,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:05:42,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:05:42,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:05:42,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:42,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:42,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:05:42,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:05:43,124 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:05:43,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:05:43,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:05:43,269 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:05:43,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 38 transitions. Complement of second has 10 states. [2025-01-10 07:05:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:05:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:05:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-01-10 07:05:43,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 6 letters. Loop has 5 letters. [2025-01-10 07:05:43,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:43,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 11 letters. Loop has 5 letters. [2025-01-10 07:05:43,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:43,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 6 letters. Loop has 10 letters. [2025-01-10 07:05:43,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:43,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2025-01-10 07:05:43,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:43,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 37 transitions. [2025-01-10 07:05:43,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-01-10 07:05:43,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-01-10 07:05:43,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2025-01-10 07:05:43,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:05:43,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-01-10 07:05:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2025-01-10 07:05:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-01-10 07:05:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 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:05:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-01-10 07:05:43,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-01-10 07:05:43,317 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-01-10 07:05:43,317 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:05:43,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2025-01-10 07:05:43,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:43,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:43,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:43,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:05:43,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:05:43,323 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#1(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#3(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#4(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "call f_#t~mem8#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" [2025-01-10 07:05:43,323 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem11#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;" "havoc f_#t~nondet14#1;" "assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1;" [2025-01-10 07:05:43,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash 891079725, now seen corresponding path program 1 times [2025-01-10 07:05:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94382513] [2025-01-10 07:05:43,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:43,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:43,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:43,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:43,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:43,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:43,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 103163386, now seen corresponding path program 1 times [2025-01-10 07:05:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823609012] [2025-01-10 07:05:43,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:43,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:43,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:43,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash 171840846, now seen corresponding path program 1 times [2025-01-10 07:05:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320222825] [2025-01-10 07:05:43,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:43,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:43,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:43,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:43,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:43,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:43,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:45,053 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:05:45,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:05:45,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:05:45,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:05:45,053 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:05:45,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:45,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:05:45,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:05:45,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration4_Lasso [2025-01-10 07:05:45,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:05:45,053 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:05:45,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:45,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:05:46,409 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:05:46,409 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:05:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,412 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:05:46,413 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:05:46,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,436 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:05:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,438 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:05:46,440 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:05:46,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,473 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:05:46,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,478 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:05:46,479 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:05:46,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:46,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:46,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,502 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:05:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,504 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:05:46,505 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:05:46,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,531 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:05:46,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,533 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:05:46,534 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:05:46,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:05:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,556 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:05:46,557 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:05:46,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:05:46,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,578 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:05:46,580 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:05:46,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 07:05:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,618 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:05:46,620 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:05:46,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:05:46,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,641 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:05:46,642 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:05:46,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:05:46,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,665 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:05:46,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,668 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:05:46,669 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:05:46,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:05:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,689 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:05:46,691 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:05:46,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:46,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:46,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,719 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:05:46,721 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:05:46,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,753 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:05:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,756 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:05:46,758 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:05:46,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:05:46,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,778 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:05:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,781 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:05:46,782 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:05:46,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,812 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:05:46,812 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:05:46,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,850 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:05:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,852 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:05:46,852 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:05:46,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:05:46,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:05:46,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:05:46,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:46,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,890 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:05:46,890 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:05:46,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:46,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:46,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:05:46,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 07:05:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,917 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:05:46,918 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:05:46,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:05:46,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:05:46,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:05:46,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:05:46,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:05:46,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:05:46,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:05:46,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:05:46,961 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-01-10 07:05:46,961 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-01-10 07:05:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:05:46,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:46,981 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:05:46,982 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:05:46,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:05:46,994 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-01-10 07:05:46,994 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:05:46,994 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_f_~y~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_f_~y~0#1.base) 0)_2 Supporting invariants [1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_2 - 2 >= 0] [2025-01-10 07:05:47,001 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:05:47,187 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:05:47,224 INFO L156 tatePredicateManager]: 55 out of 57 supporting invariants were superfluous and have been removed [2025-01-10 07:05:47,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:05:47,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:05:47,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2025-01-10 07:05:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:47,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:47,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:47,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:47,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:05:47,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:05:47,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:05:47,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:05:47,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:05:47,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:47,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:05:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:05:47,452 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:05:47,452 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:05:47,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:05:47,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 10 states. [2025-01-10 07:05:47,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:05:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:05:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-01-10 07:05:47,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 6 letters. Loop has 5 letters. [2025-01-10 07:05:47,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:47,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 11 letters. Loop has 5 letters. [2025-01-10 07:05:47,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:47,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 6 letters. Loop has 10 letters. [2025-01-10 07:05:47,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:05:47,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2025-01-10 07:05:47,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:47,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 49 transitions. [2025-01-10 07:05:47,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-01-10 07:05:47,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-01-10 07:05:47,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2025-01-10 07:05:47,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:05:47,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-01-10 07:05:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2025-01-10 07:05:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-01-10 07:05:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:05:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-01-10 07:05:47,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 07:05:47,521 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-01-10 07:05:47,521 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:05:47,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2025-01-10 07:05:47,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:05:47,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:05:47,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:05:47,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:05:47,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:05:47,522 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#1(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#3(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#4(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1;" "call f_#t~mem8#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#3(f_~k~0#1.base, f_~k~0#1.offset, 4);" "assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;" "call f_#t~mem11#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;" "havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-01-10 07:05:47,522 INFO L754 eck$LassoCheckResult]: Loop: "call f_#t~mem15#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#1(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#4(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#4(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1;" "call f_#t~mem11#1 := read~int#0(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0;" "assume f_#t~short13#1;call f_#t~mem12#1 := read~int#1(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0;" "assume f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;" "havoc f_#t~nondet14#1;" "assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1;" [2025-01-10 07:05:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -353079657, now seen corresponding path program 1 times [2025-01-10 07:05:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840574753] [2025-01-10 07:05:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:47,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:47,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:47,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:47,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:47,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:05:47,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:05:47,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:47,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:47,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2093287144, now seen corresponding path program 1 times [2025-01-10 07:05:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897086495] [2025-01-10 07:05:47,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:47,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:47,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:47,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:47,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:05:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:05:47,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:05:47,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:05:47,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:05:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:05:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1401659182, now seen corresponding path program 1 times [2025-01-10 07:05:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:05:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653897287] [2025-01-10 07:05:47,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:05:47,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:05:47,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:05:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:05:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:05:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653897287] [2025-01-10 07:05:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653897287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:05:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166557290] [2025-01-10 07:05:47,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:05:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:05:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:05:47,915 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:05:47,916 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:05:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:05:47,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:05:47,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:05:47,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:05:47,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:05:47,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:05:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:05:47,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:05:48,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-10 07:05:48,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:05:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:05:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:05:48,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:05:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:05:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166557290] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:05:48,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:05:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-01-10 07:05:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714838743] [2025-01-10 07:05:48,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:05:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:05:48,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:05:48,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:05:48,289 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:05:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:05:48,351 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-01-10 07:05:48,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2025-01-10 07:05:48,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:05:48,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-01-10 07:05:48,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:05:48,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:05:48,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:05:48,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:05:48,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:05:48,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:05:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:05:48,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:05:48,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:05:48,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:05:48,354 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:05:48,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:05:48,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:05:48 BoogieIcfgContainer [2025-01-10 07:05:48,361 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:05:48,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:05:48,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:05:48,362 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:05:48,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:05:37" (3/4) ... [2025-01-10 07:05:48,363 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:05:48,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:05:48,365 INFO L158 Benchmark]: Toolchain (without parser) took 11329.64ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 109.7MB in the beginning and 110.7MB in the end (delta: -946.7kB). Peak memory consumption was 193.0MB. Max. memory is 16.1GB. [2025-01-10 07:05:48,365 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:05:48,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 93.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:05:48,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.01ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:05:48,365 INFO L158 Benchmark]: Boogie Preprocessor took 42.99ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:05:48,365 INFO L158 Benchmark]: RCFGBuilder took 316.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 69.6MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:05:48,366 INFO L158 Benchmark]: BuchiAutomizer took 10622.26ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 69.6MB in the beginning and 110.8MB in the end (delta: -41.2MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2025-01-10 07:05:48,366 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 335.5MB. Free memory was 110.8MB in the beginning and 110.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:05:48,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 93.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.01ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.99ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.75ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 69.6MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 10622.26ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 69.6MB in the beginning and 110.8MB in the end (delta: -41.2MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 335.5MB. Free memory was 110.8MB in the beginning and 110.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 9.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 107 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital310 mio100 ax105 hnf100 lsp94 ukn76 mio100 lsp25 div100 bol100 ite100 ukn100 eq166 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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:05:48,378 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:05:48,580 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