./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:24:41,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:24:41,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:24:41,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:24:41,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:24:41,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:24:41,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:24:41,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:24:41,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:24:41,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:24:41,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:24:41,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:24:41,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:24:41,954 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:24:41,956 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:24:41,956 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:24:41,957 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:24:41,957 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:24:41,957 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:24:41,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:24:41,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:24:41,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:24:41,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:24:41,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:24:41,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:24:41,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:24:41,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:24:41,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:24:41,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:24:41,962 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:24:41,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:24:41,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:24:41,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:24:41,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:24:41,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:24:41,968 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:24:41,968 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1855ccd5ef0c8491e97368f082ce5aab941ff0c5bf681c3496fd6584d783f6d [2024-11-09 15:24:42,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:24:42,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:24:42,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:24:42,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:24:42,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:24:42,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2024-11-09 15:24:43,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:24:43,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:24:43,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2024-11-09 15:24:43,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db89f4963/3566d22b1793416b83b7fbf3985f00cf/FLAGbad182506 [2024-11-09 15:24:43,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db89f4963/3566d22b1793416b83b7fbf3985f00cf [2024-11-09 15:24:43,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:24:43,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:24:43,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:43,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:24:43,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:24:43,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:43" (1/1) ... [2024-11-09 15:24:43,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbf3cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:43, skipping insertion in model container [2024-11-09 15:24:43,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:43" (1/1) ... [2024-11-09 15:24:44,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:24:44,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:44,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:24:44,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:44,371 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:24:44,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44 WrapperNode [2024-11-09 15:24:44,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:44,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:44,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:24:44,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:24:44,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,414 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-11-09 15:24:44,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:44,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:24:44,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:24:44,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:24:44,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,443 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [5, 2, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 1, 2]. [2024-11-09 15:24:44,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:24:44,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:24:44,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:24:44,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:24:44,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (1/1) ... [2024-11-09 15:24:44,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:44,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:44,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:44,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:24:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:24:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:24:44,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:24:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:24:44,739 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:24:44,741 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:24:44,922 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 15:24:44,922 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:24:44,937 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:24:44,937 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:24:44,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:44 BoogieIcfgContainer [2024-11-09 15:24:44,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:24:44,939 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:24:44,940 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:24:44,944 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:24:44,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:44,946 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:24:43" (1/3) ... [2024-11-09 15:24:44,947 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11df543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:44, skipping insertion in model container [2024-11-09 15:24:44,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:44,948 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:44" (2/3) ... [2024-11-09 15:24:44,948 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11df543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:44, skipping insertion in model container [2024-11-09 15:24:44,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:44,948 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:44" (3/3) ... [2024-11-09 15:24:44,951 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.12-alloca.i [2024-11-09 15:24:45,014 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:24:45,016 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:24:45,016 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:24:45,017 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:24:45,017 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:24:45,017 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:24:45,017 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:24:45,018 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:24:45,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:45,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:45,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:45,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:45,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:45,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:45,049 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:24:45,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:45,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:45,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:45,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:45,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:45,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:45,057 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 8#L559-2true [2024-11-09 15:24:45,057 INFO L747 eck$LassoCheckResult]: Loop: 8#L559-2true call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 12#L555-1true assume test_fun_#t~short7#1; 3#L555-3true assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 6#L556true assume test_fun_#t~mem8#1 > 0;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 8#L559-2true [2024-11-09 15:24:45,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:24:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509598963] [2024-11-09 15:24:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:45,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2024-11-09 15:24:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174891093] [2024-11-09 15:24:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:45,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2024-11-09 15:24:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86924507] [2024-11-09 15:24:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:45,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:46,180 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:24:46,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:24:46,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:24:46,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:24:46,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:24:46,183 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:46,183 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:24:46,183 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:24:46,184 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration1_Lasso [2024-11-09 15:24:46,184 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:24:46,184 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:24:46,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:46,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:47,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:24:47,027 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:24:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:24:47,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:24:47,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:24:47,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:24:47,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:24:47,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:24:47,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:24:47,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:24:47,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:24:47,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:24:47,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:47,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:47,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:47,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:47,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:24:47,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:47,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:47,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:24:47,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,304 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:24:47,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:47,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:47,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:47,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:24:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:24:47,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:47,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:47,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:47,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:47,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:47,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:47,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:47,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:24:47,392 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:24:47,392 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:24:47,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:47,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:47,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:47,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:24:47,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:24:47,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:24:47,425 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:24:47,426 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2024-11-09 15:24:47,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:47,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:24:47,509 INFO L156 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2024-11-09 15:24:47,515 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:24:47,515 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:24:47,516 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-09 15:24:47,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:47,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:24:47,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:47,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:24:47,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:47,720 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 [2024-11-09 15:24:47,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:47,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 41 states and 59 transitions. Complement of second has 10 states. [2024-11-09 15:24:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:24:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-11-09 15:24:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:24:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:24:47,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-09 15:24:47,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:47,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-11-09 15:24:47,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-09 15:24:47,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 25 states and 39 transitions. [2024-11-09 15:24:47,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:24:47,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:24:47,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 39 transitions. [2024-11-09 15:24:47,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:47,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 39 transitions. [2024-11-09 15:24:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 39 transitions. [2024-11-09 15:24:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-09 15:24:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2024-11-09 15:24:47,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-09 15:24:47,882 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2024-11-09 15:24:47,883 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:24:47,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2024-11-09 15:24:47,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-09 15:24:47,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:47,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:47,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:24:47,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:24:47,884 INFO L745 eck$LassoCheckResult]: Stem: 199#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 204#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 202#L555-1 [2024-11-09 15:24:47,884 INFO L747 eck$LassoCheckResult]: Loop: 202#L555-1 assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 > 0; 187#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 188#L556 assume test_fun_#t~mem8#1 > 0;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 201#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 202#L555-1 [2024-11-09 15:24:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 15:24:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300879858] [2024-11-09 15:24:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:47,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:47,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:47,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2024-11-09 15:24:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485896307] [2024-11-09 15:24:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:47,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:47,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2024-11-09 15:24:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:47,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928752519] [2024-11-09 15:24:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928752519] [2024-11-09 15:24:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928752519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:24:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634271818] [2024-11-09 15:24:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:24:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:24:48,397 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:48,431 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2024-11-09 15:24:48,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 53 transitions. [2024-11-09 15:24:48,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-09 15:24:48,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 37 transitions. [2024-11-09 15:24:48,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:24:48,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:24:48,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2024-11-09 15:24:48,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:48,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2024-11-09 15:24:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2024-11-09 15:24:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2024-11-09 15:24:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2024-11-09 15:24:48,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-09 15:24:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:24:48,437 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-09 15:24:48,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:24:48,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2024-11-09 15:24:48,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:48,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:48,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:48,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:24:48,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:48,438 INFO L745 eck$LassoCheckResult]: Stem: 268#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 272#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 270#L555-1 [2024-11-09 15:24:48,438 INFO L747 eck$LassoCheckResult]: Loop: 270#L555-1 assume test_fun_#t~short7#1; 259#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 260#L556 assume !(test_fun_#t~mem8#1 > 0);havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 263#L559 assume test_fun_#t~mem10#1 > 0;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem11#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 264#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 270#L555-1 [2024-11-09 15:24:48,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2024-11-09 15:24:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754077808] [2024-11-09 15:24:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:48,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 38423515, now seen corresponding path program 1 times [2024-11-09 15:24:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508134202] [2024-11-09 15:24:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 177751320, now seen corresponding path program 1 times [2024-11-09 15:24:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378735205] [2024-11-09 15:24:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378735205] [2024-11-09 15:24:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378735205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:24:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864713197] [2024-11-09 15:24:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:24:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:24:48,740 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:48,778 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-11-09 15:24:48,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-11-09 15:24:48,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:48,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2024-11-09 15:24:48,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:24:48,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:24:48,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-09 15:24:48,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:48,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:24:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-09 15:24:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:24:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-09 15:24:48,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:24:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:24:48,784 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:24:48,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:24:48,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-09 15:24:48,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:48,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:48,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:48,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:24:48,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:48,785 INFO L745 eck$LassoCheckResult]: Stem: 306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 310#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 308#L555-1 [2024-11-09 15:24:48,785 INFO L747 eck$LassoCheckResult]: Loop: 308#L555-1 assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 > 0; 299#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 300#L556 assume !(test_fun_#t~mem8#1 > 0);havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 303#L559 assume test_fun_#t~mem10#1 > 0;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem11#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 304#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 308#L555-1 [2024-11-09 15:24:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2024-11-09 15:24:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445414358] [2024-11-09 15:24:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:48,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,826 INFO L85 PathProgramCache]: Analyzing trace with hash 40270557, now seen corresponding path program 1 times [2024-11-09 15:24:48,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832498116] [2024-11-09 15:24:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 179598362, now seen corresponding path program 1 times [2024-11-09 15:24:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144200245] [2024-11-09 15:24:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:48,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:49,532 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:24:49,532 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:24:49,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:24:49,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:24:49,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:24:49,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:49,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:24:49,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:24:49,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration4_Lasso [2024-11-09 15:24:49,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:24:49,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:24:49,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:49,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:50,278 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:24:50,279 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:24:50,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,281 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:24:50,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,308 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:24:50,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:24:50,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,335 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:24:50,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,363 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:24:50,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,389 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:24:50,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:24:50,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:24:50,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,448 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:24:50,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:24:50,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:24:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,503 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:24:50,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:24:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,529 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:24:50,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:50,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:50,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:50,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,559 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:24:50,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:24:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,596 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:24:50,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,638 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:24:50,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,681 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:24:50,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,693 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:24:50,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,697 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:24:50,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:24:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,718 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:24:50,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:50,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,745 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:24:50,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:24:50,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:50,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:50,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:50,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:50,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:50,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:50,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:24:50,775 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:24:50,775 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:24:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:50,776 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:24:50,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:24:50,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:24:50,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:24:50,789 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:24:50,789 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 Supporting invariants [] [2024-11-09 15:24:50,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:50,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-09 15:24:50,871 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-11-09 15:24:50,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:24:50,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:24:50,874 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-09 15:24:50,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:50,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:24:50,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:50,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:24:50,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:51,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-09 15:24:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:51,052 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:24:51,053 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:51,110 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) Result 31 states and 38 transitions. Complement of second has 9 states. [2024-11-09 15:24:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:24:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2024-11-09 15:24:51,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2024-11-09 15:24:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-09 15:24:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2024-11-09 15:24:51,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:51,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2024-11-09 15:24:51,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:51,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2024-11-09 15:24:51,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:24:51,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:24:51,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2024-11-09 15:24:51,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:51,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-09 15:24:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2024-11-09 15:24:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-11-09 15:24:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-11-09 15:24:51,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-09 15:24:51,119 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-09 15:24:51,119 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:24:51,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-11-09 15:24:51,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:24:51,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:51,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:51,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:24:51,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:24:51,120 INFO L745 eck$LassoCheckResult]: Stem: 478#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~ret15#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet13#1, main_#t~nondet14#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 482#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 489#L555-1 assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 > 0; 473#L555-3 [2024-11-09 15:24:51,120 INFO L747 eck$LassoCheckResult]: Loop: 473#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 474#L556 assume !(test_fun_#t~mem8#1 > 0);havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 468#L559 assume !(test_fun_#t~mem10#1 > 0);havoc test_fun_#t~mem10#1; 469#L559-2 call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 480#L555-1 assume !test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 > 0; 473#L555-3 [2024-11-09 15:24:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-09 15:24:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097264467] [2024-11-09 15:24:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:51,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:51,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 45964859, now seen corresponding path program 1 times [2024-11-09 15:24:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718409568] [2024-11-09 15:24:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:51,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:51,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:51,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1272583860, now seen corresponding path program 1 times [2024-11-09 15:24:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790241537] [2024-11-09 15:24:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:24:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790241537] [2024-11-09 15:24:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790241537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:51,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:24:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878894118] [2024-11-09 15:24:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:24:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:24:51,344 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:51,377 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-09 15:24:51,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-11-09 15:24:51,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:24:51,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-11-09 15:24:51,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:24:51,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:24:51,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:24:51,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:24:51,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:51,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:24:51,381 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:51,381 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:24:51,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:24:51,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:24:51,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:24:51,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:24:51 BoogieIcfgContainer [2024-11-09 15:24:51,391 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:24:51,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:24:51,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:24:51,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:24:51,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:44" (3/4) ... [2024-11-09 15:24:51,395 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:24:51,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:24:51,398 INFO L158 Benchmark]: Toolchain (without parser) took 7444.51ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 92.1MB in the beginning and 129.2MB in the end (delta: -37.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,398 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 146.8MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:24:51,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.36ms. Allocated memory is still 146.8MB. Free memory was 92.1MB in the beginning and 73.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 146.8MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,402 INFO L158 Benchmark]: Boogie Preprocessor took 67.60ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 118.1MB in the end (delta: -46.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,402 INFO L158 Benchmark]: RCFGBuilder took 454.46ms. Allocated memory is still 146.8MB. Free memory was 118.1MB in the beginning and 105.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,403 INFO L158 Benchmark]: BuchiAutomizer took 6452.22ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 104.8MB in the beginning and 130.3MB in the end (delta: -25.5MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,403 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 230.7MB. Free memory was 130.3MB in the beginning and 129.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:51,404 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.88ms. Allocated memory is still 146.8MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.36ms. Allocated memory is still 146.8MB. Free memory was 92.1MB in the beginning and 73.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 146.8MB. Free memory was 73.8MB in the beginning and 71.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.60ms. Allocated memory is still 146.8MB. Free memory was 71.8MB in the beginning and 118.1MB in the end (delta: -46.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * RCFGBuilder took 454.46ms. Allocated memory is still 146.8MB. Free memory was 118.1MB in the beginning and 105.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6452.22ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 104.8MB in the beginning and 130.3MB in the end (delta: -25.5MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 230.7MB. Free memory was 130.3MB in the beginning and 129.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 42 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax109 hnf100 lsp94 ukn68 mio100 lsp26 div100 bol100 ite100 ukn100 eq160 hnf90 smp100 dnf119 smp86 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! [2024-11-09 15:24:51,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE