./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:29:12,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:29:12,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:29:12,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:29:12,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:29:12,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:29:12,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:29:12,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:29:12,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:29:12,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:29:12,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:29:12,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:29:12,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:29:12,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:29:12,932 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:29:12,933 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:29:12,933 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:29:12,933 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:29:12,933 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:29:12,934 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:29:12,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:29:12,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:29:12,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:29:12,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:29:12,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:29:12,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:29:12,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:29:12,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:29:12,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:29:12,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:29:12,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:29:12,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:29:12,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:29:12,940 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:29:12,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:29:12,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:29:12,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:29:12,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:29:12,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:29:12,942 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:29:12,943 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-17 08:29:13,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:29:13,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:29:13,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:29:13,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:29:13,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:29:13,239 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-17 08:29:14,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:29:14,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:29:14,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-11-17 08:29:14,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6172e213/3d70819ecbb745dd9dcc6c56706fd461/FLAGd1bbecea0 [2024-11-17 08:29:15,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6172e213/3d70819ecbb745dd9dcc6c56706fd461 [2024-11-17 08:29:15,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:29:15,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:29:15,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:15,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:29:15,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:29:15,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b21d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15, skipping insertion in model container [2024-11-17 08:29:15,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:29:15,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:15,598 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:29:15,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:29:15,663 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:29:15,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15 WrapperNode [2024-11-17 08:29:15,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:29:15,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:15,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:29:15,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:29:15,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,701 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2024-11-17 08:29:15,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:29:15,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:29:15,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:29:15,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:29:15,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,730 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-17 08:29:15,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,738 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:29:15,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:29:15,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:29:15,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:29:15,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (1/1) ... [2024-11-17 08:29:15,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:15,784 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-17 08:29:15,791 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-17 08:29:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:29:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:29:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:29:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:29:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 08:29:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:29:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 08:29:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 08:29:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 08:29:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 08:29:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:29:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:29:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:29:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:29:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:29:15,979 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:29:15,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:29:16,265 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 08:29:16,269 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#2: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 08:29:16,282 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-17 08:29:16,283 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:29:16,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:29:16,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:29:16,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:16 BoogieIcfgContainer [2024-11-17 08:29:16,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:29:16,300 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:29:16,300 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:29:16,303 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:29:16,303 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:16,304 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:29:15" (1/3) ... [2024-11-17 08:29:16,304 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34addc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:16, skipping insertion in model container [2024-11-17 08:29:16,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:16,304 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:29:15" (2/3) ... [2024-11-17 08:29:16,305 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34addc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:16, skipping insertion in model container [2024-11-17 08:29:16,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:16,305 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:16" (3/3) ... [2024-11-17 08:29:16,306 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2024-11-17 08:29:16,357 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:29:16,357 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:29:16,357 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:29:16,357 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:29:16,358 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:29:16,358 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:29:16,358 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:29:16,358 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:29:16,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:16,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-17 08:29:16,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:16,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:16,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:29:16,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-17 08:29:16,382 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:29:16,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:16,384 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-17 08:29:16,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:16,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:16,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:29:16,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-17 08:29:16,389 INFO L745 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue 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); 22#ULTIMATE.init_returnLabel#1true assume true;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; 20#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; 5#L525-1true [2024-11-17 08:29:16,390 INFO L747 eck$LassoCheckResult]: Loop: 5#L525-1true assume true; 5#L525-1true [2024-11-17 08:29:16,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 74442, now seen corresponding path program 1 times [2024-11-17 08:29:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393291862] [2024-11-17 08:29:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:16,584 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-17 08:29:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393291862] [2024-11-17 08:29:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393291862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:29:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090774371] [2024-11-17 08:29:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:16,591 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2024-11-17 08:29:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583084749] [2024-11-17 08:29:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:29:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:29:16,641 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-17 08:29:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:16,661 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-17 08:29:16,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-11-17 08:29:16,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-11-17 08:29:16,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 22 transitions. [2024-11-17 08:29:16,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:29:16,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:29:16,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-17 08:29:16,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:16,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:29:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-17 08:29:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-17 08:29:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 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-17 08:29:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-17 08:29:16,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:29:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:29:16,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:29:16,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:29:16,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2024-11-17 08:29:16,706 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-11-17 08:29:16,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:16,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:16,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:29:16,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:29:16,707 INFO L745 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY 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); 64#ULTIMATE.init_returnLabel#1 assume true;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; 72#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 65#L534 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; 66#L537 [2024-11-17 08:29:16,707 INFO L747 eck$LassoCheckResult]: Loop: 66#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 75#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 70#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 71#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 73#L541 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; 66#L537 [2024-11-17 08:29:16,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2307771, now seen corresponding path program 1 times [2024-11-17 08:29:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553400703] [2024-11-17 08:29:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 62921437, now seen corresponding path program 1 times [2024-11-17 08:29:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544020840] [2024-11-17 08:29:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 76810339, now seen corresponding path program 1 times [2024-11-17 08:29:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069432587] [2024-11-17 08:29:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:16,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:17,661 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:29:17,662 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:29:17,662 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:29:17,662 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:29:17,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:29:17,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:17,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:29:17,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:29:17,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2024-11-17 08:29:17,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:29:17,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:29:17,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:17,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:18,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:29:18,498 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:29:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,502 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-17 08:29:18,504 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-17 08:29:18,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:18,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:18,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,548 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-17 08:29:18,550 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-17 08:29:18,551 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-17 08:29:18,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,582 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-17 08:29:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,585 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-17 08:29:18,586 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-17 08:29:18,587 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-17 08:29:18,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,620 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-17 08:29:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,623 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-17 08:29:18,629 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-17 08:29:18,630 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-17 08:29:18,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,657 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-17 08:29:18,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,659 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-17 08:29:18,660 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-17 08:29:18,661 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-17 08:29:18,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:29:18,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,686 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-17 08:29:18,687 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-17 08:29:18,688 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-17 08:29:18,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:18,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:18,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:18,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,724 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-17 08:29:18,724 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-17 08:29:18,725 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-17 08:29:18,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:18,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,756 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-17 08:29:18,758 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-17 08:29:18,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:18,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:29:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,793 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-17 08:29:18,794 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-17 08:29:18,795 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-17 08:29:18,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,829 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-17 08:29:18,831 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-17 08:29:18,832 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-17 08:29:18,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:29:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,866 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-17 08:29:18,867 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-17 08:29:18,868 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-17 08:29:18,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:18,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:18,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,902 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-17 08:29:18,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,904 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-17 08:29:18,906 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-17 08:29:18,907 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-17 08:29:18,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:18,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:18,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:18,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:29:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,940 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-17 08:29:18,942 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-17 08:29:18,943 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-17 08:29:18,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:18,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:18,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:18,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:18,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:29:18,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:18,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:18,981 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-17 08:29:18,983 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-17 08:29:18,984 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-17 08:29:18,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:18,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:18,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:18,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:19,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:19,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:19,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:19,022 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-17 08:29:19,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:19,024 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-17 08:29:19,027 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-17 08:29:19,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:19,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:19,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:19,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:19,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:19,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:19,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:19,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:19,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:19,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:29:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:19,063 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-17 08:29:19,064 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-17 08:29:19,065 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-17 08:29:19,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:19,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:19,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:19,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:19,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:19,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:19,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:19,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:29:19,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:19,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:19,105 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-17 08:29:19,106 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-17 08:29:19,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:19,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:19,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:19,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:19,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:19,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:19,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:19,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:19,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:29:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:19,144 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-17 08:29:19,145 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-17 08:29:19,146 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-17 08:29:19,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:19,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:19,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:19,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:19,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:19,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:19,166 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:29:19,175 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:29:19,175 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-17 08:29:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:19,193 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-17 08:29:19,195 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-17 08:29:19,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:29:19,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:29:19,207 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:29:19,208 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-17 08:29:19,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:19,261 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:29:19,288 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-17 08:29:19,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:19,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:29:19,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:19,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:29:19,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:19,418 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-17 08:29:19,421 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-17 08:29:19,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 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-17 08:29:19,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 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 29 states and 37 transitions. Complement of second has 9 states. [2024-11-17 08:29:19,495 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-17 08:29:19,495 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-17 08:29:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-17 08:29:19,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2024-11-17 08:29:19,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:19,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2024-11-17 08:29:19,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:19,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-17 08:29:19,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:19,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-11-17 08:29:19,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-17 08:29:19,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 32 transitions. [2024-11-17 08:29:19,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:29:19,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:29:19,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2024-11-17 08:29:19,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:19,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-17 08:29:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2024-11-17 08:29:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-17 08:29:19,503 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-17 08:29:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-17 08:29:19,503 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-17 08:29:19,503 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-17 08:29:19,504 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:29:19,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-11-17 08:29:19,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-17 08:29:19,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:19,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:19,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:19,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-17 08:29:19,505 INFO L745 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY 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); 185#ULTIMATE.init_returnLabel#1 assume true;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; 195#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 186#L534 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; 187#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 199#L537-2 assume !main_#t~short5#1; 191#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 192#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; 180#L525 [2024-11-17 08:29:19,505 INFO L747 eck$LassoCheckResult]: Loop: 180#L525 assume true; 180#L525 [2024-11-17 08:29:19,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash 972310037, now seen corresponding path program 1 times [2024-11-17 08:29:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082113545] [2024-11-17 08:29:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:19,633 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-17 08:29:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082113545] [2024-11-17 08:29:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082113545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:19,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:19,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:29:19,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259817061] [2024-11-17 08:29:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:19,634 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2024-11-17 08:29:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900593691] [2024-11-17 08:29:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:29:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:29:19,648 INFO L87 Difference]: Start difference. First operand 22 states and 28 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-17 08:29:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:19,688 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-17 08:29:19,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2024-11-17 08:29:19,689 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-17 08:29:19,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2024-11-17 08:29:19,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-17 08:29:19,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-17 08:29:19,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-11-17 08:29:19,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:19,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-17 08:29:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-11-17 08:29:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-11-17 08:29:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-17 08:29:19,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-17 08:29:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:29:19,694 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-17 08:29:19,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:29:19,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-17 08:29:19,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-17 08:29:19,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:19,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:19,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:19,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-17 08:29:19,695 INFO L745 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY 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); 254#ULTIMATE.init_returnLabel#1 assume true;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; 264#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 255#L534 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; 256#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 268#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 260#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 261#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; 249#L525 [2024-11-17 08:29:19,695 INFO L747 eck$LassoCheckResult]: Loop: 249#L525 assume true; 249#L525 [2024-11-17 08:29:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 972309076, now seen corresponding path program 1 times [2024-11-17 08:29:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916549259] [2024-11-17 08:29:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:19,725 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-17 08:29:19,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916549259] [2024-11-17 08:29:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916549259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:29:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164110897] [2024-11-17 08:29:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:19,726 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 2 times [2024-11-17 08:29:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438718115] [2024-11-17 08:29:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:29:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:29:19,734 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 10 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-17 08:29:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:19,743 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-17 08:29:19,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-11-17 08:29:19,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:19,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 27 transitions. [2024-11-17 08:29:19,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:29:19,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:29:19,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2024-11-17 08:29:19,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:19,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:29:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2024-11-17 08:29:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-17 08:29:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-17 08:29:19,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:29:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:29:19,748 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:29:19,748 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:29:19,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-17 08:29:19,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:19,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:19,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:19,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:19,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:29:19,749 INFO L745 eck$LassoCheckResult]: Stem: 305#ULTIMATE.startENTRY 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); 306#ULTIMATE.init_returnLabel#1 assume true;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; 315#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 307#L534 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; 308#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 319#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 312#L537-1 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 310#L545 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; 311#L549 [2024-11-17 08:29:19,749 INFO L747 eck$LassoCheckResult]: Loop: 311#L549 assume true; 302#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 304#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 317#L553 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; 311#L549 [2024-11-17 08:29:19,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 972309009, now seen corresponding path program 1 times [2024-11-17 08:29:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172592792] [2024-11-17 08:29:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:19,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1568858, now seen corresponding path program 1 times [2024-11-17 08:29:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952853385] [2024-11-17 08:29:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:19,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:19,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1023628694, now seen corresponding path program 1 times [2024-11-17 08:29:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769033669] [2024-11-17 08:29:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:19,987 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-17 08:29:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769033669] [2024-11-17 08:29:19,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769033669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:19,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:19,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:29:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349429804] [2024-11-17 08:29:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:29:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:29:20,074 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-17 08:29:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:20,142 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-17 08:29:20,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2024-11-17 08:29:20,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:20,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2024-11-17 08:29:20,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:29:20,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:29:20,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-11-17 08:29:20,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:20,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-17 08:29:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-11-17 08:29:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-11-17 08:29:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-17 08:29:20,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-17 08:29:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:29:20,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-17 08:29:20,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:29:20,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2024-11-17 08:29:20,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:20,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:20,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:20,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:20,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:20,155 INFO L745 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY 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); 375#ULTIMATE.init_returnLabel#1 assume true;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; 385#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 376#L534 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; 377#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 389#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 381#L537-1 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 382#L545 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; 396#L549 assume true; 372#L549-1 assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); 373#L556 main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; 378#L557 [2024-11-17 08:29:20,155 INFO L747 eck$LassoCheckResult]: Loop: 378#L557 assume true; 391#L557-1 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; 378#L557 [2024-11-17 08:29:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 798263643, now seen corresponding path program 1 times [2024-11-17 08:29:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005318295] [2024-11-17 08:29:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:20,193 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-17 08:29:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005318295] [2024-11-17 08:29:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005318295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:29:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990264473] [2024-11-17 08:29:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:20,196 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2024-11-17 08:29:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156295986] [2024-11-17 08:29:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:29:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:29:20,260 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-17 08:29:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:20,290 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-17 08:29:20,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2024-11-17 08:29:20,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:20,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 34 transitions. [2024-11-17 08:29:20,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:29:20,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:29:20,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2024-11-17 08:29:20,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:20,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:29:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2024-11-17 08:29:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-11-17 08:29:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-17 08:29:20,294 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-17 08:29:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:29:20,295 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-17 08:29:20,295 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:29:20,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-11-17 08:29:20,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:20,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:20,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:20,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:20,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:29:20,298 INFO L745 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY 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); 445#ULTIMATE.init_returnLabel#1 assume true;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; 455#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 446#L534 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; 447#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 461#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 453#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 454#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 456#L541 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; 459#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 460#L537-2 assume !main_#t~short5#1; 452#L537-1 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 450#L545 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; 451#L549 assume true; 442#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 443#L550 [2024-11-17 08:29:20,298 INFO L747 eck$LassoCheckResult]: Loop: 443#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 457#L553 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; 458#L549 assume true; 463#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 443#L550 [2024-11-17 08:29:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash 736169881, now seen corresponding path program 1 times [2024-11-17 08:29:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37554166] [2024-11-17 08:29:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:20,377 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-17 08:29:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37554166] [2024-11-17 08:29:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37554166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:29:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159371999] [2024-11-17 08:29:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:29:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:20,380 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-17 08:29:20,382 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-17 08:29:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:20,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:29:20,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:20,489 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-17 08:29:20,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:29:20,522 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-17 08:29:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159371999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:29:20,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:29:20,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-17 08:29:20,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139545671] [2024-11-17 08:29:20,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:29:20,523 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1410458, now seen corresponding path program 2 times [2024-11-17 08:29:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115476678] [2024-11-17 08:29:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:29:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:29:20,667 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-17 08:29:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:20,766 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-17 08:29:20,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2024-11-17 08:29:20,768 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2024-11-17 08:29:20,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 83 transitions. [2024-11-17 08:29:20,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-17 08:29:20,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-17 08:29:20,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 83 transitions. [2024-11-17 08:29:20,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:20,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-17 08:29:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 83 transitions. [2024-11-17 08:29:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 39. [2024-11-17 08:29:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 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-17 08:29:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-17 08:29:20,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-17 08:29:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:29:20,775 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-17 08:29:20,775 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:29:20,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2024-11-17 08:29:20,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:20,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:20,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:20,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:20,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:29:20,777 INFO L745 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY 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); 644#ULTIMATE.init_returnLabel#1 assume true;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; 654#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 645#L534 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; 646#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 661#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 662#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 679#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 658#L541 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; 659#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 660#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 651#L537-1 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 649#L545 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; 650#L549 assume true; 641#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 642#L550 [2024-11-17 08:29:20,777 INFO L747 eck$LassoCheckResult]: Loop: 642#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 656#L553 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; 657#L549 assume true; 665#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 642#L550 [2024-11-17 08:29:20,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 735246360, now seen corresponding path program 1 times [2024-11-17 08:29:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858148073] [2024-11-17 08:29:20,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1410458, now seen corresponding path program 3 times [2024-11-17 08:29:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461752524] [2024-11-17 08:29:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:20,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1695507919, now seen corresponding path program 1 times [2024-11-17 08:29:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831145058] [2024-11-17 08:29:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831145058] [2024-11-17 08:29:21,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831145058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:29:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072868615] [2024-11-17 08:29:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:29:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:21,140 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-17 08:29:21,142 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-17 08:29:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:21,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 08:29:21,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:21,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:29:21,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 08:29:21,329 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-17 08:29:21,390 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-17 08:29:21,444 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-17 08:29:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:21,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:29:21,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:29:21,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2024-11-17 08:29:21,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:29:21,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-11-17 08:29:21,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-17 08:29:21,771 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-17 08:29:21,771 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-17 08:29:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072868615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:29:21,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:29:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-11-17 08:29:21,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693668587] [2024-11-17 08:29:21,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:29:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:22,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 08:29:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2024-11-17 08:29:22,010 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 10 Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:22,195 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-17 08:29:22,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2024-11-17 08:29:22,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:22,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 47 transitions. [2024-11-17 08:29:22,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-17 08:29:22,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-17 08:29:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-11-17 08:29:22,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:22,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-17 08:29:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-11-17 08:29:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-17 08:29:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 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-17 08:29:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-17 08:29:22,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-17 08:29:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:29:22,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-17 08:29:22,206 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:29:22,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2024-11-17 08:29:22,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:29:22,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:22,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:22,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:22,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:29:22,208 INFO L745 eck$LassoCheckResult]: Stem: 866#ULTIMATE.startENTRY 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); 867#ULTIMATE.init_returnLabel#1 assume true;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; 877#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 868#L534 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; 869#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 885#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 899#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 897#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 895#L541 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; 886#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 887#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 902#L537-1 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 901#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 900#L541 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; 893#L537 assume true;main_#t~short5#1 := main_~i~0#1 < 30; 882#L537-2 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 874#L537-1 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 872#L545 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; 873#L549 assume true; 864#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 865#L550 [2024-11-17 08:29:22,211 INFO L747 eck$LassoCheckResult]: Loop: 865#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 879#L553 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; 880#L549 assume true; 888#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 865#L550 [2024-11-17 08:29:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 368708976, now seen corresponding path program 2 times [2024-11-17 08:29:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295154036] [2024-11-17 08:29:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:22,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:22,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1410458, now seen corresponding path program 4 times [2024-11-17 08:29:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800848815] [2024-11-17 08:29:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:22,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:22,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:22,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1180517257, now seen corresponding path program 2 times [2024-11-17 08:29:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706486774] [2024-11-17 08:29:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706486774] [2024-11-17 08:29:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706486774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:29:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245388167] [2024-11-17 08:29:22,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:29:22,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:29:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:22,815 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-17 08:29:22,816 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-17 08:29:22,921 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:29:22,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:29:22,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-17 08:29:22,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:22,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 08:29:22,990 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-17 08:29:22,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:29:23,042 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-17 08:29:23,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 08:29:23,094 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-17 08:29:23,099 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-17 08:29:23,141 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-17 08:29:23,184 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-17 08:29:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:23,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:29:23,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_177| Int) (|v_ULTIMATE.start_main_~t~0#1.base_22| Int)) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_177|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_22|) 0)) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_380) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_381) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_177|) 1)) (< |v_ULTIMATE.start_main_~p~0#1.offset_177| 0))) is different from false [2024-11-17 08:29:23,471 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-17 08:29:23,472 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-17 08:29:23,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:29:23,566 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 27 treesize of output 33 [2024-11-17 08:29:23,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:29:23,578 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 65 treesize of output 68 [2024-11-17 08:29:23,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-11-17 08:29:23,594 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 50 treesize of output 46 [2024-11-17 08:29:23,607 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-17 08:29:23,607 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-17 08:29:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-17 08:29:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245388167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:29:23,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:29:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-17 08:29:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301752673] [2024-11-17 08:29:23,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:29:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 08:29:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=421, Unknown=7, NotChecked=42, Total=552 [2024-11-17 08:29:23,866 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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-17 08:29:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:24,063 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-17 08:29:24,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2024-11-17 08:29:24,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:29:24,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2024-11-17 08:29:24,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:29:24,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:29:24,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:29:24,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:29:24,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:29:24,064 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:29:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:29:24,065 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:29:24,065 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:29:24,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:29:24,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:29:24,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:29:24,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:29:24 BoogieIcfgContainer [2024-11-17 08:29:24,072 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:29:24,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:29:24,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:29:24,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:29:24,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:16" (3/4) ... [2024-11-17 08:29:24,075 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:29:24,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:29:24,077 INFO L158 Benchmark]: Toolchain (without parser) took 8870.64ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 102.8MB in the beginning and 134.9MB in the end (delta: -32.1MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-11-17 08:29:24,077 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:29:24,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.73ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 83.0MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 08:29:24,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:29:24,078 INFO L158 Benchmark]: Boogie Preprocessor took 40.67ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 78.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 08:29:24,078 INFO L158 Benchmark]: IcfgBuilder took 554.28ms. Allocated memory is still 159.4MB. Free memory was 78.9MB in the beginning and 124.0MB in the end (delta: -45.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-17 08:29:24,078 INFO L158 Benchmark]: BuchiAutomizer took 7772.14ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 124.0MB in the beginning and 134.9MB in the end (delta: -10.9MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2024-11-17 08:29:24,078 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 270.5MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:29:24,080 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.20ms. Allocated memory is still 159.4MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.73ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 83.0MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.67ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 78.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 554.28ms. Allocated memory is still 159.4MB. Free memory was 78.9MB in the beginning and 124.0MB in the end (delta: -45.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 7772.14ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 124.0MB in the beginning and 134.9MB in the end (delta: -10.9MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 270.5MB. Free memory is still 134.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 7.7s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 6.6s. 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, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 125 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU2 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: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:29:24,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:24,305 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-17 08:29:24,506 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-17 08:29:24,707 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