./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc 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/list-ext-properties/simple-ext.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:28:10,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:28:10,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:28:10,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:28:10,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:28:10,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:28:10,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:28:10,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:28:10,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:28:10,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:28:10,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:28:10,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:28:10,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:28:10,951 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:28:10,951 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:28:10,952 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:28:10,952 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:28:10,952 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:28:10,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:28:10,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:28:10,954 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:28:10,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:28:10,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:28:10,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:28:10,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:28:10,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:28:10,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:28:10,954 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:28:10,955 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2025-02-06 19:28:11,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:28:11,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:28:11,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:28:11,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:28:11,226 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:28:11,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2025-02-06 19:28:12,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f59f7882/2bf9a63bbbad45109ec1b9f9f6b65491/FLAGb4100c81b [2025-02-06 19:28:12,726 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:28:12,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2025-02-06 19:28:12,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f59f7882/2bf9a63bbbad45109ec1b9f9f6b65491/FLAGb4100c81b [2025-02-06 19:28:12,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f59f7882/2bf9a63bbbad45109ec1b9f9f6b65491 [2025-02-06 19:28:12,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:28:12,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:28:12,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:12,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:28:12,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:28:12,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:12" (1/1) ... [2025-02-06 19:28:12,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ce57e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:12, skipping insertion in model container [2025-02-06 19:28:12,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:12" (1/1) ... [2025-02-06 19:28:12,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:28:12,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:12,983 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:28:13,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:13,051 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:28:13,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13 WrapperNode [2025-02-06 19:28:13,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:13,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:13,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:28:13,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:28:13,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,082 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2025-02-06 19:28:13,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:13,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:28:13,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:28:13,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:28:13,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,110 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-06 19:28:13,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:28:13,126 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:28:13,126 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:28:13,126 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:28:13,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (1/1) ... [2025-02-06 19:28:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:13,163 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-02-06 19:28:13,166 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-02-06 19:28:13,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:28:13,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:28:13,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:28:13,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:28:13,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:28:13,285 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:28:13,427 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 19:28:13,427 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#2: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 19:28:13,437 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-06 19:28:13,438 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:28:13,444 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:28:13,445 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:28:13,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:13 BoogieIcfgContainer [2025-02-06 19:28:13,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:28:13,446 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:28:13,446 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:28:13,449 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:28:13,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:13,450 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:28:12" (1/3) ... [2025-02-06 19:28:13,451 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27bc6501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:13, skipping insertion in model container [2025-02-06 19:28:13,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:13,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:13" (2/3) ... [2025-02-06 19:28:13,452 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27bc6501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:13, skipping insertion in model container [2025-02-06 19:28:13,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:13,452 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:13" (3/3) ... [2025-02-06 19:28:13,453 INFO L363 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2025-02-06 19:28:13,492 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:28:13,493 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:28:13,493 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:28:13,493 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:28:13,493 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:28:13,493 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:28:13,493 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:28:13,493 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:28:13,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-02-06 19:28:13,508 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-02-06 19:28:13,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:13,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:13,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:28:13,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:13,513 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:28:13,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-02-06 19:28:13,515 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-02-06 19:28:13,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:13,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:13,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:28:13,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:13,520 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume main_~a~0#1.base == 0 && main_~a~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1;" [2025-02-06 19:28:13,520 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" [2025-02-06 19:28:13,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 62526, now seen corresponding path program 1 times [2025-02-06 19:28:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444927674] [2025-02-06 19:28:13,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:13,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:13,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:13,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444927674] [2025-02-06 19:28:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444927674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:13,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:28:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106945561] [2025-02-06 19:28:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:13,672 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:13,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 67, now seen corresponding path program 1 times [2025-02-06 19:28:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756775736] [2025-02-06 19:28:13,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:13,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:13,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:13,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:13,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:13,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:28:13,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:28:13,713 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 19:28:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:13,729 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-02-06 19:28:13,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-02-06 19:28:13,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:28:13,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2025-02-06 19:28:13,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:28:13,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:28:13,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2025-02-06 19:28:13,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:13,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-06 19:28:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2025-02-06 19:28:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:28:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-02-06 19:28:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-02-06 19:28:13,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-06 19:28:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:28:13,756 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-06 19:28:13,757 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:28:13,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-02-06 19:28:13,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:28:13,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:13,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:13,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:28:13,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:28:13,760 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" [2025-02-06 19:28:13,760 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0);" "call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2025-02-06 19:28:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1938364, now seen corresponding path program 1 times [2025-02-06 19:28:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:13,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701359010] [2025-02-06 19:28:13,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:13,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:13,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:13,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:13,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:13,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 52424083, now seen corresponding path program 1 times [2025-02-06 19:28:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089973351] [2025-02-06 19:28:13,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:13,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:13,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:13,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:13,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:13,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:13,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1532987720, now seen corresponding path program 1 times [2025-02-06 19:28:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598029106] [2025-02-06 19:28:13,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:13,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:28:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:28:13,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:28:13,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:28:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:13,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:14,474 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:28:14,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:28:14,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:28:14,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:28:14,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:28:14,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:14,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:28:14,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:28:14,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2025-02-06 19:28:14,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:28:14,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:28:14,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:14,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:15,087 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:28:15,090 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:28:15,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:28:15,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:28:15,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:28:15,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:28:15,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:15,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,182 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-02-06 19:28:15,184 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-02-06 19:28:15,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:15,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,204 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-02-06 19:28:15,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,206 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-02-06 19:28:15,208 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-02-06 19:28:15,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,230 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-02-06 19:28:15,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,234 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-02-06 19:28:15,235 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-02-06 19:28:15,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,259 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-02-06 19:28:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,261 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-02-06 19:28:15,263 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-02-06 19:28:15,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,282 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-02-06 19:28:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,284 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-02-06 19:28:15,285 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-02-06 19:28:15,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,305 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-02-06 19:28:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,307 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-02-06 19:28:15,308 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-02-06 19:28:15,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:28:15,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,332 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-02-06 19:28:15,333 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-02-06 19:28:15,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:28:15,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,354 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-02-06 19:28:15,355 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-02-06 19:28:15,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:28:15,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:28:15,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:28:15,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,398 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:28:15,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:28:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,425 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:28:15,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:28:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,450 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:28:15,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:15,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:15,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:15,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:28:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,475 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:28:15,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:28:15,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:28:15,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-02-06 19:28:15,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:15,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:28:15,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,525 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:28:15,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:15,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:15,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:15,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:15,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:15,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:15,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:15,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:28:15,551 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:28:15,552 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-06 19:28:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:15,555 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:15,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:28:15,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:28:15,568 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:28:15,569 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:28:15,569 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 59 Supporting invariants [] [2025-02-06 19:28:15,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:28:15,587 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-02-06 19:28:15,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:15,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:15,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:15,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:15,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:28:15,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:15,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:15,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:15,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:15,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:28:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:15,704 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-02-06 19:28:15,705 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-02-06 19:28:15,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 26 states and 34 transitions. Complement of second has 9 states. [2025-02-06 19:28:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:28:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-02-06 19:28:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-02-06 19:28:15,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2025-02-06 19:28:15,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:15,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2025-02-06 19:28:15,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:15,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2025-02-06 19:28:15,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:15,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2025-02-06 19:28:15,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2025-02-06 19:28:15,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 29 transitions. [2025-02-06 19:28:15,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:28:15,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:28:15,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-02-06 19:28:15,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:15,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-06 19:28:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-02-06 19:28:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-02-06 19:28:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-02-06 19:28:15,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 19:28:15,774 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 19:28:15,774 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:28:15,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2025-02-06 19:28:15,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2025-02-06 19:28:15,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:15,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:15,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:15,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:28:15,774 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume !main_#t~short5#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" [2025-02-06 19:28:15,775 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" "assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1;" "call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-02-06 19:28:15,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash -880734285, now seen corresponding path program 1 times [2025-02-06 19:28:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:15,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513148891] [2025-02-06 19:28:15,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:15,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:28:15,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:28:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513148891] [2025-02-06 19:28:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513148891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:28:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114704561] [2025-02-06 19:28:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:15,843 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 41669, now seen corresponding path program 1 times [2025-02-06 19:28:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754566455] [2025-02-06 19:28:15,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:15,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:15,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:15,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:15,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:15,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:15,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:15,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:28:15,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:28:15,933 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:15,973 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-02-06 19:28:15,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2025-02-06 19:28:15,974 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2025-02-06 19:28:15,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 40 transitions. [2025-02-06 19:28:15,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-06 19:28:15,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-06 19:28:15,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2025-02-06 19:28:15,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:15,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-02-06 19:28:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2025-02-06 19:28:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2025-02-06 19:28:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-02-06 19:28:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-02-06 19:28:15,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-02-06 19:28:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:28:15,976 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-02-06 19:28:15,977 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:28:15,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2025-02-06 19:28:15,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2025-02-06 19:28:15,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:15,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:15,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:15,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:28:15,978 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" [2025-02-06 19:28:15,978 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" "assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1;" "call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-02-06 19:28:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -880735246, now seen corresponding path program 1 times [2025-02-06 19:28:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140935039] [2025-02-06 19:28:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:28:15,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:28:15,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:15,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:15,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:28:16,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:28:16,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 41669, now seen corresponding path program 2 times [2025-02-06 19:28:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998765053] [2025-02-06 19:28:16,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:16,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:28:16,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:16,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -28490444, now seen corresponding path program 1 times [2025-02-06 19:28:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084944076] [2025-02-06 19:28:16,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:16,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:28:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084944076] [2025-02-06 19:28:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084944076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:28:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992007673] [2025-02-06 19:28:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:28:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:28:16,294 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:16,343 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-02-06 19:28:16,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2025-02-06 19:28:16,344 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2025-02-06 19:28:16,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2025-02-06 19:28:16,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 19:28:16,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:28:16,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2025-02-06 19:28:16,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:16,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-06 19:28:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2025-02-06 19:28:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2025-02-06 19:28:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-02-06 19:28:16,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-06 19:28:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:28:16,348 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-06 19:28:16,348 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:28:16,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2025-02-06 19:28:16,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2025-02-06 19:28:16,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:16,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:16,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:16,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:16,349 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume main_~t~0#1.base == 0 && main_~t~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1;" [2025-02-06 19:28:16,349 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" [2025-02-06 19:28:16,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -880735211, now seen corresponding path program 1 times [2025-02-06 19:28:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449281599] [2025-02-06 19:28:16,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:28:16,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:28:16,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449281599] [2025-02-06 19:28:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449281599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:28:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930077329] [2025-02-06 19:28:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:16,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:16,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times [2025-02-06 19:28:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875607353] [2025-02-06 19:28:16,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:16,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:16,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:16,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:16,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:16,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:28:16,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:28:16,386 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:16,392 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2025-02-06 19:28:16,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2025-02-06 19:28:16,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:16,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 27 transitions. [2025-02-06 19:28:16,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:28:16,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:28:16,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2025-02-06 19:28:16,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:16,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-06 19:28:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2025-02-06 19:28:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-06 19:28:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 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-02-06 19:28:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-02-06 19:28:16,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-06 19:28:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:28:16,395 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-06 19:28:16,395 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:28:16,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-02-06 19:28:16,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:16,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:16,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:16,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:16,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:16,396 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;" [2025-02-06 19:28:16,396 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_~p~0#1.base, main_~p~0#1.offset := main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;" [2025-02-06 19:28:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1532988846, now seen corresponding path program 1 times [2025-02-06 19:28:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390104239] [2025-02-06 19:28:16,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:28:16,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:28:16,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390104239] [2025-02-06 19:28:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390104239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:16,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:16,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:28:16,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827161400] [2025-02-06 19:28:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:16,426 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 1 times [2025-02-06 19:28:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325575897] [2025-02-06 19:28:16,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:16,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:16,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:16,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:16,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:28:16,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:28:16,480 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02-06 19:28:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:16,505 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-02-06 19:28:16,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2025-02-06 19:28:16,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:16,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 29 transitions. [2025-02-06 19:28:16,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:28:16,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:28:16,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2025-02-06 19:28:16,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:16,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-06 19:28:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2025-02-06 19:28:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-02-06 19:28:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-02-06 19:28:16,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-06 19:28:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:28:16,509 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-06 19:28:16,509 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:28:16,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2025-02-06 19:28:16,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:16,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:16,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:16,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:16,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:28:16,511 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0);" "call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume !main_#t~short5#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:16,511 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1;" "call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -694124227, now seen corresponding path program 1 times [2025-02-06 19:28:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033983975] [2025-02-06 19:28:16,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:28:16,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:28:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033983975] [2025-02-06 19:28:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033983975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:28:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975405821] [2025-02-06 19:28:16,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:28:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:16,586 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:28:16,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 19:28:16,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:28:16,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:28:16,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:16,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:28:16,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:28:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975405821] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:28:16,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:28:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 19:28:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977263977] [2025-02-06 19:28:16,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:28:16,682 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 40529, now seen corresponding path program 3 times [2025-02-06 19:28:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773231267] [2025-02-06 19:28:16,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:28:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:16,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:28:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,687 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:16,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:28:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:28:16,758 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-02-06 19:28:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:16,824 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-02-06 19:28:16,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2025-02-06 19:28:16,827 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2025-02-06 19:28:16,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 70 transitions. [2025-02-06 19:28:16,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-06 19:28:16,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-06 19:28:16,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 70 transitions. [2025-02-06 19:28:16,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:16,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-02-06 19:28:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 70 transitions. [2025-02-06 19:28:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2025-02-06 19:28:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-02-06 19:28:16,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-06 19:28:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:28:16,832 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-06 19:28:16,832 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:28:16,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2025-02-06 19:28:16,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:16,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:16,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:16,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:16,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:28:16,833 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0);" "call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:16,833 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1;" "call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -694154018, now seen corresponding path program 1 times [2025-02-06 19:28:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225178755] [2025-02-06 19:28:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:28:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:28:16,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:28:16,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:28:16,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 40529, now seen corresponding path program 4 times [2025-02-06 19:28:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467308668] [2025-02-06 19:28:16,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:28:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:28:16,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:28:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:16,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:16,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:16,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:16,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 725190740, now seen corresponding path program 1 times [2025-02-06 19:28:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337068865] [2025-02-06 19:28:16,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:16,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:16,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:28:16,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:28:16,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:16,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337068865] [2025-02-06 19:28:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337068865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:28:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338347433] [2025-02-06 19:28:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:17,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:28:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:17,109 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:28:17,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 19:28:17,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:28:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:28:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 19:28:17,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:17,225 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-02-06 19:28:17,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 19:28:17,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 19:28:17,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 19:28:17,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 19:28:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:17,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:28:17,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:28:17,517 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2025-02-06 19:28:17,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:28:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2025-02-06 19:28:17,542 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 19:28:17,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 19:28:17,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-06 19:28:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338347433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:28:17,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:28:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-02-06 19:28:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093972920] [2025-02-06 19:28:17,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:28:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:17,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:28:17,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=246, Unknown=5, NotChecked=0, Total=306 [2025-02-06 19:28:17,727 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 10 Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:17,848 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-06 19:28:17,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2025-02-06 19:28:17,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:17,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 37 states and 43 transitions. [2025-02-06 19:28:17,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:28:17,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:28:17,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2025-02-06 19:28:17,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:28:17,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-06 19:28:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2025-02-06 19:28:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-06 19:28:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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-02-06 19:28:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-06 19:28:17,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 19:28:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:28:17,852 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 19:28:17,852 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:28:17,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2025-02-06 19:28:17,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:28:17,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:17,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:17,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:17,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:28:17,853 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0);" "havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0);" "call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;" "assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0);" "call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" "assume true;main_#t~short5#1 := main_~i~0#1 < 30;" "assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1;" "assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;" "call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:17,853 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1;" "call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0;call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4);" [2025-02-06 19:28:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1215273766, now seen corresponding path program 2 times [2025-02-06 19:28:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:17,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590936143] [2025-02-06 19:28:17,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:17,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 19:28:17,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:28:17,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:28:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:17,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:17,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:28:17,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:28:17,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:17,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:17,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:17,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 40529, now seen corresponding path program 5 times [2025-02-06 19:28:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:17,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051896507] [2025-02-06 19:28:17,887 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:28:17,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:17,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:17,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:17,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:28:17,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:17,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:28:17,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:28:17,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:17,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:17,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1941414184, now seen corresponding path program 2 times [2025-02-06 19:28:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313780983] [2025-02-06 19:28:17,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:17,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:28:17,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:28:17,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:28:17,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313780983] [2025-02-06 19:28:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313780983] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:28:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199327855] [2025-02-06 19:28:18,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:18,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:28:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:18,254 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:28:18,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 19:28:18,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:28:18,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:28:18,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:28:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:18,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 19:28:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:18,386 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 19:28:18,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 19:28:18,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-06 19:28:18,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 19:28:18,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:28:18,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 19:28:18,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 19:28:18,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 19:28:18,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 19:28:18,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 19:28:18,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 19:28:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:18,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:28:18,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:28:18,861 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-02-06 19:28:18,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:28:18,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 68 [2025-02-06 19:28:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-06 19:28:18,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-02-06 19:28:18,904 INFO L349 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2025-02-06 19:28:18,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2025-02-06 19:28:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199327855] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:28:19,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:28:19,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2025-02-06 19:28:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931301624] [2025-02-06 19:28:19,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:28:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:19,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:28:19,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2025-02-06 19:28:19,097 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 9 Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 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-02-06 19:28:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:19,231 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-02-06 19:28:19,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2025-02-06 19:28:19,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:28:19,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:28:19,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:28:19,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:19,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:28:19,232 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:28:19,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:28:19,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:28:19,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:28:19,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:28:19 BoogieIcfgContainer [2025-02-06 19:28:19,241 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:28:19,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:28:19,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:28:19,242 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:28:19,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:13" (3/4) ... [2025-02-06 19:28:19,244 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:28:19,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:28:19,246 INFO L158 Benchmark]: Toolchain (without parser) took 6481.49ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 120.6MB in the beginning and 78.5MB in the end (delta: 42.1MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2025-02-06 19:28:19,247 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.86ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 103.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 100.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: IcfgBuilder took 319.00ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 86.0MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: BuchiAutomizer took 5795.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 85.8MB in the beginning and 78.6MB in the end (delta: 7.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-02-06 19:28:19,248 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 201.3MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:19,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.86ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 103.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 100.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 319.00ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 86.0MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5795.54ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 85.8MB in the beginning and 78.6MB in the end (delta: 7.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 201.3MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (8 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 59) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 56 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 103 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf100 lsp86 ukn42 mio100 lsp26 div100 bol100 ite100 ukn100 eq146 hnf97 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-06 19:28:19,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:19,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:19,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:19,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE