./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-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/fermat-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 e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:07:01,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:07:01,820 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:07:01,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:07:01,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:07:01,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:07:01,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:07:01,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:07:01,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:07:01,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:07:01,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:07:01,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:07:01,848 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:07:01,848 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:07:01,848 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:07:01,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:07:01,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:07:01,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:07:01,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:07:01,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:07:01,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:07:01,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:07:01,851 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:07:01,851 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 -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2025-01-10 07:07:02,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:07:02,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:07:02,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:07:02,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:07:02,075 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:07:02,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2025-01-10 07:07:03,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/942fe80fb/9b7ba38bc3084f5eb9adbfbc20da432b/FLAG23f37aa24 [2025-01-10 07:07:03,482 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:07:03,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2025-01-10 07:07:03,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/942fe80fb/9b7ba38bc3084f5eb9adbfbc20da432b/FLAG23f37aa24 [2025-01-10 07:07:03,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/942fe80fb/9b7ba38bc3084f5eb9adbfbc20da432b [2025-01-10 07:07:03,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:07:03,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:07:03,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:07:03,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:07:03,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:07:03,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:07:03" (1/1) ... [2025-01-10 07:07:03,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@847ed3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:03, skipping insertion in model container [2025-01-10 07:07:03,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:07:03" (1/1) ... [2025-01-10 07:07:03,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:07:04,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:07:04,023 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:07:04,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:07:04,083 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:07:04,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04 WrapperNode [2025-01-10 07:07:04,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:07:04,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:07:04,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:07:04,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:07:04,090 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:07:04" (1/1) ... [2025-01-10 07:07:04,097 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:07:04" (1/1) ... [2025-01-10 07:07:04,111 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-01-10 07:07:04,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:07:04,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:07:04,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:07:04,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:07:04,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,128 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [4, 8, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [1, 3, 3, 2]. [2025-01-10 07:07:04,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:07:04,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:07:04,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:07:04,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:07:04,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (1/1) ... [2025-01-10 07:07:04,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:04,166 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:07:04,168 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:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:07:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:07:04,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:07:04,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:07:04,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:07:04,375 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-10 07:07:04,376 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:07:04,383 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:07:04,384 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:07:04,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:07:04 BoogieIcfgContainer [2025-01-10 07:07:04,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:07:04,385 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:07:04,385 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:07:04,389 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:07:04,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:04,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:07:03" (1/3) ... [2025-01-10 07:07:04,390 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a10eb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:07:04, skipping insertion in model container [2025-01-10 07:07:04,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:04,390 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:04" (2/3) ... [2025-01-10 07:07:04,391 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a10eb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:07:04, skipping insertion in model container [2025-01-10 07:07:04,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:04,391 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:07:04" (3/3) ... [2025-01-10 07:07:04,392 INFO L363 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2025-01-10 07:07:04,426 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:07:04,427 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:07:04,427 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:07:04,427 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:07:04,427 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:07:04,427 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:07:04,427 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:07:04,427 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:07:04,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:07:04,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:07:04,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:04,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:04,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:07:04,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:07:04,444 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:07:04,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:07:04,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:07:04,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:04,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:04,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:07:04,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:07:04,450 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2025-01-10 07:07:04,450 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" [2025-01-10 07:07:04,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:07:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223466932] [2025-01-10 07:07:04,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:04,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:04,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:04,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:04,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:04,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:04,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:04,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1191847950, now seen corresponding path program 1 times [2025-01-10 07:07:04,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:04,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339820169] [2025-01-10 07:07:04,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:04,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:04,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:04,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 07:07:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198397535] [2025-01-10 07:07:04,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:04,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:04,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:04,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:04,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:07:04,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:04,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:04,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:04,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:04,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:04,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:04,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 354448880, now seen corresponding path program 1 times [2025-01-10 07:07:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:04,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-01-10 07:07:04,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:07:04,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:07:04,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:05,186 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:07:05,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-01-10 07:07:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089818807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:07:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:07:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:07:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834703523] [2025-01-10 07:07:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:07:17,882 WARN L286 SmtUtils]: Spent 12.69s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:07:30,053 WARN L286 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 07:07:42,880 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:07:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:07:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:07:42,904 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:43,005 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-01-10 07:07:43,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2025-01-10 07:07:43,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-01-10 07:07:43,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 19 transitions. [2025-01-10 07:07:43,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-01-10 07:07:43,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 07:07:43,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2025-01-10 07:07:43,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:07:43,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-10 07:07:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2025-01-10 07:07:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 07:07:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-01-10 07:07:43,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-10 07:07:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:07:43,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-10 07:07:43,033 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:07:43,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2025-01-10 07:07:43,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-01-10 07:07:43,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:43,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:43,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:07:43,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:07:43,034 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2025-01-10 07:07:43,034 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" [2025-01-10 07:07:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:07:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997193400] [2025-01-10 07:07:43,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:07:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:43,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:43,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:43,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:07:43,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:43,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:43,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:43,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:43,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:43,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1191846028, now seen corresponding path program 1 times [2025-01-10 07:07:43,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:43,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064826487] [2025-01-10 07:07:43,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:43,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 07:07:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803542094] [2025-01-10 07:07:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:43,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:43,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:43,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:43,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:07:43,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:43,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:43,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:07:43,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:07:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:43,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 354450802, now seen corresponding path program 1 times [2025-01-10 07:07:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:43,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338449521] [2025-01-10 07:07:43,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:43,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:07:43,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:07:43,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 07:07:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296557747] [2025-01-10 07:07:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:43,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 07:07:43,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:07:43,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:07:43,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:43,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:07:43,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:07:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:43,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:55,694 WARN L286 SmtUtils]: Spent 12.39s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:08:08,054 WARN L286 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:08:09,014 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:08:09,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:08:09,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:08:09,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:08:09,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:08:09,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:08:09,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:08:09,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration2_Lasso [2025-01-10 07:08:09,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:08:09,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:08:09,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:10,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:34,594 WARN L286 SmtUtils]: Spent 24.18s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-01-10 07:08:47,040 WARN L286 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-01-10 07:08:47,187 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:08:47,192 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:08:47,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,196 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:08:47,198 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:08:47,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:08:47,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:47,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:47,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:47,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,230 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:08:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,233 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:08:47,234 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:08:47,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08:47,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:47,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:47,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:47,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,258 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:08:47,259 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:08:47,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08:47,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:47,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:47,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:47,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:47,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,286 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:08:47,288 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:08:47,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08:47,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:08:47,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:08:47,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,320 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:08:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,322 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:08:47,323 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:08:47,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:47,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:08:47,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:08:47,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,356 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:08:47,357 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:08:47,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08:47,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:47,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:08:47,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:08:47,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:47,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,384 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:08:47,386 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:08:47,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08:47,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:47,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:47,398 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 07:08:47,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:47,411 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-01-10 07:08:47,412 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-01-10 07:08:47,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:08:47,476 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-01-10 07:08:47,478 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-01-10 07:08:47,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:47,481 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:08:47,482 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:08:47,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:08:47,497 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-01-10 07:08:47,497 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:08:47,498 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1) = -1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1 Supporting invariants [] [2025-01-10 07:08:47,505 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:08:47,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:47,706 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2025-01-10 07:08:47,710 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:08:47,711 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:08:47,711 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2025-01-10 07:08:47,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 07:08:47,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 07:08:47,712 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-01-10 07:08:47,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:08:47,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:08:47,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:47,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:47,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:08:47,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:47,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:47,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:47,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:47,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:08:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:47,812 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 31 treesize of output 19 [2025-01-10 07:08:47,902 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:08:47,904 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:08:47,905 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:08:47,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 28 transitions. Complement of second has 7 states. [2025-01-10 07:08:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:08:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:08:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-01-10 07:08:47,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 7 letters. [2025-01-10 07:08:47,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:47,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 7 letters. [2025-01-10 07:08:47,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:47,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 14 letters. [2025-01-10 07:08:47,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:47,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2025-01-10 07:08:47,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:08:47,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2025-01-10 07:08:47,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-01-10 07:08:47,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:08:47,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-01-10 07:08:47,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:47,980 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-01-10 07:08:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-01-10 07:08:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-01-10 07:08:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 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:08:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-10 07:08:47,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-10 07:08:47,981 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-10 07:08:47,981 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:08:47,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2025-01-10 07:08:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:08:47,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:47,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:47,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:08:47,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:47,982 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-01-10 07:08:47,983 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-01-10 07:08:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash 28694854, now seen corresponding path program 1 times [2025-01-10 07:08:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259314144] [2025-01-10 07:08:47,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:47,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:08:47,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:08:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:48,122 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:08:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259314144] [2025-01-10 07:08:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259314144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:08:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:08:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:08:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961792658] [2025-01-10 07:08:48,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:08:48,124 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:08:48,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1163207458, now seen corresponding path program 2 times [2025-01-10 07:08:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246901164] [2025-01-10 07:08:48,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:08:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:48,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:48,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:48,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:08:48,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 07:08:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542524186] [2025-01-10 07:08:48,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:08:48,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:08:48,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:48,135 INFO L229 MonitoredProcess]: Starting monitored process 13 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:08:48,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 07:08:48,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:48,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:48,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:08:48,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:48,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:48,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:48,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:48,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:48,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:48,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:08:49,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:08:49,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:08:49,414 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:08:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:08:49,451 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-01-10 07:08:49,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2025-01-10 07:08:49,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:08:49,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2025-01-10 07:08:49,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-01-10 07:08:49,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 07:08:49,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2025-01-10 07:08:49,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:49,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-10 07:08:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2025-01-10 07:08:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-01-10 07:08:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 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:08:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-01-10 07:08:49,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-10 07:08:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:08:49,454 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-01-10 07:08:49,454 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:08:49,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-01-10 07:08:49,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:08:49,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:49,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:49,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:49,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:49,455 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#0(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#2(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#1(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-01-10 07:08:49,456 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#1(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#0(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-01-10 07:08:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1880732361, now seen corresponding path program 1 times [2025-01-10 07:08:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235134355] [2025-01-10 07:08:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:49,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:08:49,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:08:49,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:49,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235134355] [2025-01-10 07:08:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235134355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:08:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840588998] [2025-01-10 07:08:49,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:08:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:49,694 INFO L229 MonitoredProcess]: Starting monitored process 14 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:08:49,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 07:08:49,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:08:49,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:08:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:49,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:08:49,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:49,776 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 11 treesize of output 7 [2025-01-10 07:08:49,781 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 11 treesize of output 7 [2025-01-10 07:08:49,794 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 19 treesize of output 11 [2025-01-10 07:08:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:49,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:08:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840588998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:08:49,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:08:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-01-10 07:08:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210206870] [2025-01-10 07:08:49,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:08:49,930 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:08:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1163207458, now seen corresponding path program 3 times [2025-01-10 07:08:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52945714] [2025-01-10 07:08:49,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:08:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:49,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:49,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:49,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:08:49,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 07:08:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806810651] [2025-01-10 07:08:49,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:08:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:08:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:49,939 INFO L229 MonitoredProcess]: Starting monitored process 15 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:08:49,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 07:08:49,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:49,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:49,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:08:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:49,984 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:50,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:50,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:50,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:50,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace