./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:32:48,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:32:49,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:32:49,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:32:49,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:32:49,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:32:49,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:32:49,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:32:49,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:32:49,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:32:49,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:32:49,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:32:49,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:32:49,104 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:32:49,104 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:32:49,104 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:32:49,105 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:32:49,105 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:32:49,105 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:32:49,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:32:49,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:32:49,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:32:49,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:32:49,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:32:49,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:32:49,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:32:49,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:32:49,109 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:32:49,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:32:49,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:32:49,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:32:49,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:32:49,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:32:49,111 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:32:49,111 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2024-11-23 02:32:49,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:32:49,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:32:49,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:32:49,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:32:49,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:32:49,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-11-23 02:32:50,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:32:50,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:32:50,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-11-23 02:32:50,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11174ef7/1b126af1b957496088bdf8199a8a83ae/FLAGb0a7ca8af [2024-11-23 02:32:51,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11174ef7/1b126af1b957496088bdf8199a8a83ae [2024-11-23 02:32:51,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:32:51,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:32:51,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:32:51,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:32:51,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:32:51,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f23279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51, skipping insertion in model container [2024-11-23 02:32:51,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:32:51,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:32:51,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:32:51,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:32:51,679 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:32:51,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51 WrapperNode [2024-11-23 02:32:51,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:32:51,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:32:51,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:32:51,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:32:51,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,716 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-11-23 02:32:51,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:32:51,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:32:51,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:32:51,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:32:51,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,743 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-23 02:32:51,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:32:51,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:32:51,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:32:51,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:32:51,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (1/1) ... [2024-11-23 02:32:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:51,788 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-23 02:32:51,790 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-23 02:32:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:32:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:32:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:32:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:32:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:32:51,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:32:51,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:32:51,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:32:52,080 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-23 02:32:52,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:32:52,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:32:52,095 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 02:32:52,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:52 BoogieIcfgContainer [2024-11-23 02:32:52,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:32:52,096 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:32:52,097 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:32:52,100 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:32:52,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:52,101 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:32:51" (1/3) ... [2024-11-23 02:32:52,101 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6555aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:32:52, skipping insertion in model container [2024-11-23 02:32:52,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:52,102 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:51" (2/3) ... [2024-11-23 02:32:52,102 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6555aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:32:52, skipping insertion in model container [2024-11-23 02:32:52,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:52,103 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:52" (3/3) ... [2024-11-23 02:32:52,104 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2024-11-23 02:32:52,153 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:32:52,153 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:32:52,153 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:32:52,153 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:32:52,153 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:32:52,153 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:32:52,153 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:32:52,154 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:32:52,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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-23 02:32:52,173 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-11-23 02:32:52,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:52,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:52,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:32:52,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-23 02:32:52,178 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:32:52,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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-23 02:32:52,179 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-11-23 02:32:52,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:52,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:52,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:32:52,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-23 02:32:52,185 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11#L533true assume main_~a~0#1.base == 0 && main_~a~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 2#L525true [2024-11-23 02:32:52,185 INFO L747 eck$LassoCheckResult]: Loop: 2#L525true assume true; 2#L525true [2024-11-23 02:32:52,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-23 02:32:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216258769] [2024-11-23 02:32:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:52,334 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-23 02:32:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:52,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216258769] [2024-11-23 02:32:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216258769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:52,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:32:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289810254] [2024-11-23 02:32:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:52,342 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2024-11-23 02:32:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100460510] [2024-11-23 02:32:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:32:52,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:32:52,399 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:52,414 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-23 02:32:52,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-11-23 02:32:52,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-23 02:32:52,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 20 transitions. [2024-11-23 02:32:52,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-23 02:32:52,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-23 02:32:52,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-11-23 02:32:52,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:52,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-23 02:32:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-11-23 02:32:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-23 02:32:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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-23 02:32:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-23 02:32:52,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-23 02:32:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:32:52,444 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-23 02:32:52,444 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:32:52,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-23 02:32:52,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-23 02:32:52,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:52,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:52,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:32:52,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:32:52,446 INFO L745 eck$LassoCheckResult]: Stem: 67#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 64#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 65#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 56#L537-5 [2024-11-23 02:32:52,446 INFO L747 eck$LassoCheckResult]: Loop: 56#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 58#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 59#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 61#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 55#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56#L537-5 [2024-11-23 02:32:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2024-11-23 02:32:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:52,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421216249] [2024-11-23 02:32:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:52,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 43044216, now seen corresponding path program 1 times [2024-11-23 02:32:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885966379] [2024-11-23 02:32:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2099908596, now seen corresponding path program 1 times [2024-11-23 02:32:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588673407] [2024-11-23 02:32:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:52,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:53,241 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:32:53,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:32:53,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:32:53,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:32:53,243 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:32:53,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:53,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:32:53,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:32:53,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2024-11-23 02:32:53,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:32:53,243 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:32:53,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:53,887 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:32:53,890 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:32:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:53,896 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-23 02:32:53,897 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-23 02:32:53,898 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-23 02:32:53,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:53,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:53,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:53,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:53,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:53,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:53,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:53,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:53,921 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-23 02:32:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:53,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:53,923 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-23 02:32:53,925 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-23 02:32:53,926 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-23 02:32:53,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:53,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:53,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:53,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:53,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:53,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:53,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:53,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:53,949 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-23 02:32:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:53,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:53,952 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-23 02:32:53,952 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-23 02:32:53,954 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-23 02:32:53,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:53,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:53,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:53,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:53,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:53,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:53,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:53,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:53,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:32:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:53,977 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-23 02:32:53,979 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-23 02:32:53,979 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-23 02:32:53,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:53,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:53,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:53,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:53,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:53,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:53,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:53,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:32:54,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,022 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-23 02:32:54,023 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-23 02:32:54,023 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-23 02:32:54,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,040 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-23 02:32:54,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,042 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-23 02:32:54,043 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-23 02:32:54,044 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-23 02:32:54,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,067 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-23 02:32:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,068 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-23 02:32:54,069 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-23 02:32:54,070 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-23 02:32:54,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-23 02:32:54,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,091 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-23 02:32:54,092 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-23 02:32:54,093 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-23 02:32:54,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:54,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,112 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-23 02:32:54,113 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-23 02:32:54,114 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-23 02:32:54,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,131 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-23 02:32:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,133 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-23 02:32:54,135 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-23 02:32:54,136 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-23 02:32:54,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,155 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-23 02:32:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,157 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-23 02:32:54,158 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-23 02:32:54,160 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-23 02:32:54,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,192 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-23 02:32:54,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,194 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-23 02:32:54,196 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-23 02:32:54,198 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-23 02:32:54,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,217 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-23 02:32:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,219 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-23 02:32:54,221 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-23 02:32:54,223 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-23 02:32:54,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,249 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-23 02:32:54,250 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-23 02:32:54,259 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-23 02:32:54,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 02:32:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,322 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-23 02:32:54,327 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-23 02:32:54,328 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-23 02:32:54,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:54,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:54,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:54,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,348 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-23 02:32:54,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,350 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-23 02:32:54,351 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-23 02:32:54,352 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-23 02:32:54,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,379 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-23 02:32:54,380 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-23 02:32:54,381 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-23 02:32:54,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:54,403 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-23 02:32:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,406 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-23 02:32:54,410 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-23 02:32:54,411 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-23 02:32:54,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:54,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:54,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:54,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:54,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:54,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:54,427 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:32:54,436 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-23 02:32:54,436 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-23 02:32:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:54,440 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-23 02:32:54,442 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-23 02:32:54,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:32:54,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:32:54,458 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:32:54,458 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 59 Supporting invariants [] [2024-11-23 02:32:54,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:32:54,482 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-23 02:32:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:54,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:32:54,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:54,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:32:54,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:54,614 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-23 02:32:54,617 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-23 02:32:54,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:54,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-11-23 02:32:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-23 02:32:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-23 02:32:54,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2024-11-23 02:32:54,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:54,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2024-11-23 02:32:54,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:54,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-23 02:32:54,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:54,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-11-23 02:32:54,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-11-23 02:32:54,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2024-11-23 02:32:54,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-23 02:32:54,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-23 02:32:54,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-23 02:32:54,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:54,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-23 02:32:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-23 02:32:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-23 02:32:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-23 02:32:54,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:32:54,700 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:32:54,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:32:54,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-23 02:32:54,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-11-23 02:32:54,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:54,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:54,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:54,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:54,701 INFO L745 eck$LassoCheckResult]: Stem: 188#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 184#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 185#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 186#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 176#L537-1 assume !main_#t~short5#1; 177#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 180#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 189#L549-2 [2024-11-23 02:32:54,701 INFO L747 eck$LassoCheckResult]: Loop: 189#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 190#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 191#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 189#L549-2 [2024-11-23 02:32:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 206288184, now seen corresponding path program 1 times [2024-11-23 02:32:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505888464] [2024-11-23 02:32:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:54,810 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-23 02:32:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505888464] [2024-11-23 02:32:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505888464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:32:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890933776] [2024-11-23 02:32:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:54,811 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 1 times [2024-11-23 02:32:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782221143] [2024-11-23 02:32:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:54,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:54,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:32:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:32:54,902 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:54,937 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-23 02:32:54,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-11-23 02:32:54,939 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-11-23 02:32:54,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2024-11-23 02:32:54,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-23 02:32:54,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:32:54,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2024-11-23 02:32:54,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:54,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-23 02:32:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2024-11-23 02:32:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2024-11-23 02:32:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-23 02:32:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-23 02:32:54,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-23 02:32:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:32:54,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-23 02:32:54,946 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:32:54,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-11-23 02:32:54,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-11-23 02:32:54,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:54,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:54,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:54,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:54,948 INFO L745 eck$LassoCheckResult]: Stem: 253#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 247#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 248#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 249#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 238#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 239#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 242#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 254#L549-2 [2024-11-23 02:32:54,948 INFO L747 eck$LassoCheckResult]: Loop: 254#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 255#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 256#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 254#L549-2 [2024-11-23 02:32:54,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 206286262, now seen corresponding path program 1 times [2024-11-23 02:32:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636526831] [2024-11-23 02:32:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:54,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:54,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:54,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 2 times [2024-11-23 02:32:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775777933] [2024-11-23 02:32:54,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:54,979 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:32:54,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:54,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:54,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -624122213, now seen corresponding path program 1 times [2024-11-23 02:32:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386240529] [2024-11-23 02:32:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:55,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:55,114 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-23 02:32:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386240529] [2024-11-23 02:32:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386240529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:32:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176736848] [2024-11-23 02:32:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:32:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:32:55,182 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:55,235 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-23 02:32:55,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-11-23 02:32:55,236 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2024-11-23 02:32:55,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2024-11-23 02:32:55,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-23 02:32:55,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-23 02:32:55,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-23 02:32:55,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:55,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-23 02:32:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-23 02:32:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-11-23 02:32:55,238 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-23 02:32:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-11-23 02:32:55,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-23 02:32:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:32:55,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-23 02:32:55,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:32:55,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-11-23 02:32:55,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-11-23 02:32:55,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:55,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:55,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:55,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-23 02:32:55,240 INFO L745 eck$LassoCheckResult]: Stem: 323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 317#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 318#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 319#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 320#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 329#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 313#L540 assume main_~t~0#1.base == 0 && main_~t~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 322#L525-1 [2024-11-23 02:32:55,240 INFO L747 eck$LassoCheckResult]: Loop: 322#L525-1 assume true; 322#L525-1 [2024-11-23 02:32:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash 206286315, now seen corresponding path program 1 times [2024-11-23 02:32:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096497734] [2024-11-23 02:32:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:55,263 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-23 02:32:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096497734] [2024-11-23 02:32:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096497734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:32:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445289542] [2024-11-23 02:32:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:55,264 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2024-11-23 02:32:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763696899] [2024-11-23 02:32:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:32:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:32:55,270 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:55,276 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2024-11-23 02:32:55,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2024-11-23 02:32:55,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:55,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 28 transitions. [2024-11-23 02:32:55,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-23 02:32:55,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-23 02:32:55,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-23 02:32:55,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:55,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:32:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-23 02:32:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-23 02:32:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-23 02:32:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-23 02:32:55,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:32:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:32:55,279 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:32:55,280 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:32:55,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-23 02:32:55,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:55,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:55,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:55,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:55,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-23 02:32:55,281 INFO L745 eck$LassoCheckResult]: Stem: 377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 371#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 372#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 373#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 363#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 364#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 367#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 376#L549-2 assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); 369#L549-3 main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; 362#L557-2 [2024-11-23 02:32:55,281 INFO L747 eck$LassoCheckResult]: Loop: 362#L557-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_~p~0#1.base, main_~p~0#1.offset := main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset; 362#L557-2 [2024-11-23 02:32:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 672603628, now seen corresponding path program 1 times [2024-11-23 02:32:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564640337] [2024-11-23 02:32:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:55,311 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-23 02:32:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564640337] [2024-11-23 02:32:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564640337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:32:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474162374] [2024-11-23 02:32:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:55,316 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:55,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2024-11-23 02:32:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988155055] [2024-11-23 02:32:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:32:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:32:55,367 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-23 02:32:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:55,394 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-23 02:32:55,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-11-23 02:32:55,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:55,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 30 transitions. [2024-11-23 02:32:55,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-23 02:32:55,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-23 02:32:55,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-11-23 02:32:55,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:55,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-23 02:32:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-11-23 02:32:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-11-23 02:32:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-23 02:32:55,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-23 02:32:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:32:55,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-23 02:32:55,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:32:55,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-11-23 02:32:55,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:55,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:55,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:55,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:55,402 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:55,402 INFO L745 eck$LassoCheckResult]: Stem: 437#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 433#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 434#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 435#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 427#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 428#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 430#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 422#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 423#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 425#L537-1 assume !main_#t~short5#1; 426#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 429#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 438#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-11-23 02:32:55,402 INFO L747 eck$LassoCheckResult]: Loop: 439#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 440#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 441#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-11-23 02:32:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1728225128, now seen corresponding path program 1 times [2024-11-23 02:32:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238753646] [2024-11-23 02:32:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238753646] [2024-11-23 02:32:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238753646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073921031] [2024-11-23 02:32:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:55,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:55,475 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:55,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-23 02:32:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:55,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:32:55,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:55,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073921031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:55,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-23 02:32:55,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99868189] [2024-11-23 02:32:55,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:55,576 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 3 times [2024-11-23 02:32:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363835226] [2024-11-23 02:32:55,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:32:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:32:55,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:55,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 02:32:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-23 02:32:55,653 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:55,735 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2024-11-23 02:32:55,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2024-11-23 02:32:55,735 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-11-23 02:32:55,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 74 transitions. [2024-11-23 02:32:55,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-23 02:32:55,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-23 02:32:55,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2024-11-23 02:32:55,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:55,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-23 02:32:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2024-11-23 02:32:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2024-11-23 02:32:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-23 02:32:55,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-23 02:32:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:32:55,746 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-23 02:32:55,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:32:55,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-11-23 02:32:55,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:55,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:55,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:55,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:55,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:55,748 INFO L745 eck$LassoCheckResult]: Stem: 621#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 614#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 615#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 616#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 617#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 638#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 619#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 620#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 618#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 606#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 607#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 610#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 622#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-11-23 02:32:55,748 INFO L747 eck$LassoCheckResult]: Loop: 623#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 624#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 625#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-11-23 02:32:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1728165546, now seen corresponding path program 1 times [2024-11-23 02:32:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350082247] [2024-11-23 02:32:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 4 times [2024-11-23 02:32:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229337994] [2024-11-23 02:32:55,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:32:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,800 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:32:55,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:55,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:55,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash 6864355, now seen corresponding path program 1 times [2024-11-23 02:32:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874025053] [2024-11-23 02:32:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874025053] [2024-11-23 02:32:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874025053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269770637] [2024-11-23 02:32:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:56,023 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-23 02:32:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:56,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 02:32:56,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:56,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:32:56,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:32:56,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 02:32:56,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-23 02:32:56,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 02:32:56,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-23 02:32:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:56,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:56,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:32:56,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-23 02:32:56,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:32:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2024-11-23 02:32:56,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-23 02:32:56,528 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 02:32:56,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 02:32:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269770637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:56,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-11-23 02:32:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493742581] [2024-11-23 02:32:56,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 02:32:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=252, Unknown=3, NotChecked=0, Total=306 [2024-11-23 02:32:56,749 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 10 Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:56,907 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-23 02:32:56,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-11-23 02:32:56,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:56,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 44 transitions. [2024-11-23 02:32:56,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-23 02:32:56,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-23 02:32:56,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2024-11-23 02:32:56,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:56,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-23 02:32:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2024-11-23 02:32:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-23 02:32:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-23 02:32:56,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-23 02:32:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:32:56,911 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-23 02:32:56,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:32:56,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2024-11-23 02:32:56,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:32:56,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:56,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:56,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:56,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:56,912 INFO L745 eck$LassoCheckResult]: Stem: 829#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 821#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 822#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 823#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 824#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 825#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 842#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 840#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 838#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 826#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 816#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 817#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 819#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 811#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 812#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 814#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 815#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 818#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 827#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-11-23 02:32:56,912 INFO L747 eck$LassoCheckResult]: Loop: 828#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 830#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 831#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-11-23 02:32:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 46254041, now seen corresponding path program 2 times [2024-11-23 02:32:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899346537] [2024-11-23 02:32:56,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:56,933 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:32:56,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:56,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:56,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:56,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 5 times [2024-11-23 02:32:56,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:56,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206545671] [2024-11-23 02:32:56,955 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:32:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:56,959 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:32:56,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:56,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:56,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -730305964, now seen corresponding path program 2 times [2024-11-23 02:32:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442041135] [2024-11-23 02:32:56,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:56,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:32:56,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:32:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442041135] [2024-11-23 02:32:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442041135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51086557] [2024-11-23 02:32:57,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:57,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:57,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:57,312 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-23 02:32:57,389 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:32:57,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:32:57,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-23 02:32:57,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:57,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:32:57,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:32:57,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 02:32:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-23 02:32:57,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:32:57,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-23 02:32:57,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 02:32:57,555 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:32:57,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-23 02:32:57,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 02:32:57,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-23 02:32:57,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-23 02:32:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:57,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:57,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_179| Int) (v_ArrVal_387 (Array Int Int))) (or (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_179|) 1) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_179|) (< |v_ULTIMATE.start_main_~p~0#1.offset_179| 0))) is different from false [2024-11-23 02:32:57,855 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 02:32:57,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 02:32:57,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:32:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2024-11-23 02:32:57,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:32:57,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 120 [2024-11-23 02:32:57,954 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-23 02:32:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-23 02:32:57,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-23 02:32:57,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-23 02:32:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-23 02:32:58,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51086557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:58,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-23 02:32:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732252743] [2024-11-23 02:32:58,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 02:32:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=425, Unknown=13, NotChecked=42, Total=552 [2024-11-23 02:32:58,186 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:58,424 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-23 02:32:58,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-11-23 02:32:58,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:32:58,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:32:58,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:32:58,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:58,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:32:58,425 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:32:58,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:32:58,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:32:58,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:32:58,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:32:58 BoogieIcfgContainer [2024-11-23 02:32:58,433 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:32:58,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:32:58,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:32:58,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:32:58,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:52" (3/4) ... [2024-11-23 02:32:58,436 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:32:58,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:32:58,438 INFO L158 Benchmark]: Toolchain (without parser) took 7167.63ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 122.2MB in the beginning and 189.9MB in the end (delta: -67.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:32:58,438 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:32:58,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.53ms. Allocated memory is still 192.9MB. Free memory was 122.2MB in the beginning and 102.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-23 02:32:58,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.06ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 101.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:32:58,439 INFO L158 Benchmark]: Boogie Preprocessor took 38.98ms. Allocated memory is still 192.9MB. Free memory was 101.2MB in the beginning and 98.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:32:58,439 INFO L158 Benchmark]: RCFGBuilder took 339.22ms. Allocated memory is still 192.9MB. Free memory was 98.6MB in the beginning and 83.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-23 02:32:58,439 INFO L158 Benchmark]: BuchiAutomizer took 6337.06ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 83.3MB in the beginning and 189.9MB in the end (delta: -106.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:32:58,439 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 232.8MB. Free memory is still 189.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:32:58,441 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.17ms. Allocated memory is still 125.8MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.53ms. Allocated memory is still 192.9MB. Free memory was 122.2MB in the beginning and 102.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.06ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 101.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.98ms. Allocated memory is still 192.9MB. Free memory was 101.2MB in the beginning and 98.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.22ms. Allocated memory is still 192.9MB. Free memory was 98.6MB in the beginning and 83.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6337.06ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 83.3MB in the beginning and 189.9MB in the end (delta: -106.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 232.8MB. Free memory is still 189.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (8 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 59) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 112 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf100 lsp86 ukn42 mio100 lsp26 div100 bol100 ite100 ukn100 eq146 hnf97 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:32:58,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-23 02:32:58,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:58,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:59,060 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