./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:46:41,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:46:41,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:46:41,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:46:41,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:46:41,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:46:41,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:46:41,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:46:41,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:46:41,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:46:41,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:46:41,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:46:41,402 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:46:41,403 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:46:41,404 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:46:41,405 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:46:41,405 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:46:41,405 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:46:41,406 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:46:41,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:46:41,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:46:41,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:46:41,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:46:41,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:46:41,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:46:41,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:46:41,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:46:41,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:46:41,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:46:41,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:46:41,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:46:41,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:46:41,410 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:46:41,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:46:41,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:46:41,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:46:41,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:46:41,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:46:41,412 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:46:41,413 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2024-11-09 15:46:41,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:46:41,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:46:41,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:46:41,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:46:41,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:46:41,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-09 15:46:43,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:46:43,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:46:43,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-09 15:46:43,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b4d1783/cd57679c4d6a4cd4b6383368c8ea18a0/FLAGda2b11f0d [2024-11-09 15:46:43,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b4d1783/cd57679c4d6a4cd4b6383368c8ea18a0 [2024-11-09 15:46:43,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:46:43,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:46:43,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:46:43,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:46:43,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:46:43,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:46:43" (1/1) ... [2024-11-09 15:46:43,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1179b21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:43, skipping insertion in model container [2024-11-09 15:46:43,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:46:43" (1/1) ... [2024-11-09 15:46:43,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:46:43,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:46:43,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:46:43,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:46:44,019 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:46:44,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44 WrapperNode [2024-11-09 15:46:44,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:46:44,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:46:44,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:46:44,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:46:44,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,059 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2024-11-09 15:46:44,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:46:44,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:46:44,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:46:44,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:46:44,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,088 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-11-09 15:46:44,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:46:44,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:46:44,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:46:44,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:46:44,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (1/1) ... [2024-11-09 15:46:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:44,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:44,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 15:46:44,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:46:44,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 15:46:44,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:46:44,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:46:44,279 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:46:44,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:46:44,450 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-09 15:46:44,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:46:44,462 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:46:44,463 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:46:44,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:46:44 BoogieIcfgContainer [2024-11-09 15:46:44,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:46:44,464 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:46:44,464 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:46:44,468 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:46:44,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:46:44,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:46:43" (1/3) ... [2024-11-09 15:46:44,470 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2cfc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:46:44, skipping insertion in model container [2024-11-09 15:46:44,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:46:44,470 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:46:44" (2/3) ... [2024-11-09 15:46:44,471 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2cfc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:46:44, skipping insertion in model container [2024-11-09 15:46:44,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:46:44,471 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:46:44" (3/3) ... [2024-11-09 15:46:44,472 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2024-11-09 15:46:44,513 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:46:44,513 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:46:44,513 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:46:44,513 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:46:44,513 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:46:44,513 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:46:44,513 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:46:44,514 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:46:44,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:44,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:46:44,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:44,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:44,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:46:44,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:46:44,536 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:46:44,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:44,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:46:44,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:44,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:44,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:46:44,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:46:44,543 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 7#L543-4true [2024-11-09 15:46:44,543 INFO L747 eck$LassoCheckResult]: Loop: 7#L543-4true assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 3#L534true assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 9#L534-2true call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 4#L529true havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 8#L543-1true havoc main_#t~nondet12#1; 10#L543-2true assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 7#L543-4true [2024-11-09 15:46:44,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:44,549 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:46:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448319375] [2024-11-09 15:46:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:44,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:44,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:44,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1067992523, now seen corresponding path program 1 times [2024-11-09 15:46:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147126587] [2024-11-09 15:46:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:44,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:44,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:44,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash 148041741, now seen corresponding path program 1 times [2024-11-09 15:46:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211350220] [2024-11-09 15:46:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:46:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211350220] [2024-11-09 15:46:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211350220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:46:45,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:46:45,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:46:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258891420] [2024-11-09 15:46:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:46:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:46:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:46:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:46:46,956 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-09 15:46:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:46:47,001 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-09 15:46:47,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-09 15:46:47,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:46:47,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2024-11-09 15:46:47,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:46:47,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:46:47,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-09 15:46:47,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:46:47,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-09 15:46:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-09 15:46:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-09 15:46:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-09 15:46:47,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:46:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:46:47,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:46:47,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:46:47,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-09 15:46:47,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-09 15:46:47,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:47,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:47,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:46:47,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:46:47,053 INFO L745 eck$LassoCheckResult]: Stem: 51#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 55#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 50#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 45#L534-2 [2024-11-09 15:46:47,054 INFO L747 eck$LassoCheckResult]: Loop: 45#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 46#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 53#L543-1 havoc main_#t~nondet12#1; 47#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 49#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 56#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 45#L534-2 [2024-11-09 15:46:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2024-11-09 15:46:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980465126] [2024-11-09 15:46:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:47,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1274063243, now seen corresponding path program 2 times [2024-11-09 15:46:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333212256] [2024-11-09 15:46:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:47,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1985767406, now seen corresponding path program 1 times [2024-11-09 15:46:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861570625] [2024-11-09 15:46:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:47,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:49,104 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:46:49,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:46:49,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:46:49,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:46:49,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:46:49,105 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:49,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:46:49,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:46:49,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2024-11-09 15:46:49,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:46:49,106 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:46:49,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:49,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:46:50,866 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:46:50,870 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:46:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:50,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:50,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:46:50,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:50,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:50,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:50,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:50,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:50,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:50,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:50,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:50,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:50,925 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-09 15:46:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:50,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:50,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:46:50,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:50,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:50,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:50,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:50,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:50,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:46:50,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:46:50,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:50,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:46:50,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:50,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:50,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:46:50,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:50,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:50,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:50,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:50,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:50,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:50,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:50,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,015 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-09 15:46:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:46:51,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:46:51,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,075 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-09 15:46:51,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:46:51,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,103 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-09 15:46:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:46:51,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:46:51,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:46:51,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,183 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-09 15:46:51,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,185 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:46:51,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,210 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:46:51,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,241 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:46:51,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:46:51,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:46:51,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:46:51,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,297 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:46:51,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,324 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:46:51,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,349 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:46:51,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,375 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:46:51,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:51,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,404 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:46:51,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:46:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,434 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:46:51,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:46:51,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:46:51,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:46:51,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:46:51,460 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-09 15:46:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,461 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:46:51,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:46:51,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:46:51,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:46:51,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:46:51,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:46:51,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:46:51,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:46:51,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:46:51,498 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:46:51,498 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:46:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:46:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:51,503 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:46:51,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:46:51,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:46:51,532 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:46:51,532 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:46:51,533 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2024-11-09 15:46:51,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:46:51,582 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-09 15:46:51,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:51,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:46:51,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:46:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:51,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:46:51,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:46:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:51,714 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:46:51,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:51,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 6 states. [2024-11-09 15:46:51,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:46:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-09 15:46:51,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-09 15:46:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:46:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-09 15:46:51,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:46:51,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2024-11-09 15:46:51,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:46:51,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-11-09 15:46:51,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:51,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 23 transitions. [2024-11-09 15:46:51,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:46:51,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:46:51,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-11-09 15:46:51,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:46:51,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-09 15:46:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-11-09 15:46:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-09 15:46:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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-09 15:46:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-09 15:46:51,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-09 15:46:51,763 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-09 15:46:51,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:46:51,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-11-09 15:46:51,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:51,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:51,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:51,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:46:51,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-09 15:46:51,765 INFO L745 eck$LassoCheckResult]: Stem: 170#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 175#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 167#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 168#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 160#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 172#L543-1 havoc main_#t~nondet12#1; 163#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 164#L543-5 assume !(main_~length~0#1 > 0); 174#L554-1 [2024-11-09 15:46:51,765 INFO L747 eck$LassoCheckResult]: Loop: 174#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 174#L554-1 [2024-11-09 15:46:51,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash 351584945, now seen corresponding path program 1 times [2024-11-09 15:46:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600175502] [2024-11-09 15:46:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:46:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600175502] [2024-11-09 15:46:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600175502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:46:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:46:51,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:46:51,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450731347] [2024-11-09 15:46:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:46:51,824 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:46:51,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2024-11-09 15:46:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540778629] [2024-11-09 15:46:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:51,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:51,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:46:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:46:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:46:51,973 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:46:51,990 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-09 15:46:51,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2024-11-09 15:46:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:51,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 15:46:51,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:46:51,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:46:51,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-09 15:46:51,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:46:51,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 15:46:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-09 15:46:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-09 15:46:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-09 15:46:51,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-09 15:46:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:46:51,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-09 15:46:52,000 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:46:52,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-09 15:46:52,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:52,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:52,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:52,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:46:52,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-09 15:46:52,003 INFO L745 eck$LassoCheckResult]: Stem: 213#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 218#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 210#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 211#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 207#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 216#L543-1 havoc main_#t~nondet12#1; 202#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 203#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$#1(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 215#L554-1 [2024-11-09 15:46:52,003 INFO L747 eck$LassoCheckResult]: Loop: 215#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 215#L554-1 [2024-11-09 15:46:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash 351584943, now seen corresponding path program 1 times [2024-11-09 15:46:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508473188] [2024-11-09 15:46:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 2 times [2024-11-09 15:46:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365413796] [2024-11-09 15:46:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:52,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1985768616, now seen corresponding path program 1 times [2024-11-09 15:46:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330259880] [2024-11-09 15:46:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:46:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330259880] [2024-11-09 15:46:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330259880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:46:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:46:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:46:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890882934] [2024-11-09 15:46:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:46:52,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:46:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:46:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:46:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:46:52,293 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:46:52,309 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-09 15:46:52,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2024-11-09 15:46:52,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:52,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 32 transitions. [2024-11-09 15:46:52,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:46:52,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:46:52,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2024-11-09 15:46:52,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:46:52,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-09 15:46:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2024-11-09 15:46:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-11-09 15:46:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-09 15:46:52,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-09 15:46:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:46:52,315 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-09 15:46:52,315 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:46:52,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2024-11-09 15:46:52,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:52,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:52,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:52,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:46:52,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-09 15:46:52,317 INFO L745 eck$LassoCheckResult]: Stem: 270#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 276#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 267#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 260#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 261#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 274#L543-1 havoc main_#t~nondet12#1; 265#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 266#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 268#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 269#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 272#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 273#L543-1 havoc main_#t~nondet12#1; 263#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 264#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$#1(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 275#L554-1 [2024-11-09 15:46:52,317 INFO L747 eck$LassoCheckResult]: Loop: 275#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 275#L554-1 [2024-11-09 15:46:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2017814045, now seen corresponding path program 1 times [2024-11-09 15:46:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584339438] [2024-11-09 15:46:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:46:52,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584339438] [2024-11-09 15:46:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584339438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:46:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355321894] [2024-11-09 15:46:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:46:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:46:52,584 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-09 15:46:52,585 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-09 15:46:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:46:52,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 15:46:52,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:46:52,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:46:52,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 15:46:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:52,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:46:52,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 15:46:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:46:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355321894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:46:52,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:46:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-09 15:46:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392817201] [2024-11-09 15:46:52,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:46:52,809 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:46:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 3 times [2024-11-09 15:46:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370466045] [2024-11-09 15:46:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:52,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:46:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:46:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:46:52,945 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:46:52,985 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-09 15:46:52,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-11-09 15:46:52,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:52,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 15:46:52,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:46:52,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:46:52,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-11-09 15:46:52,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:46:52,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:46:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-11-09 15:46:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 15:46:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:46:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 15:46:52,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:46:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:46:52,989 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:46:52,989 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:46:52,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-11-09 15:46:52,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-09 15:46:52,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:46:52,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:46:52,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:46:52,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-09 15:46:52,991 INFO L745 eck$LassoCheckResult]: Stem: 401#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; 402#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 406#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 398#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 399#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 393#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 404#L543-1 havoc main_#t~nondet12#1; 396#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 397#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 400#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 390#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 391#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 403#L543-1 havoc main_#t~nondet12#1; 394#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 395#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$#1(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 405#L554-1 [2024-11-09 15:46:52,991 INFO L747 eck$LassoCheckResult]: Loop: 405#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 405#L554-1 [2024-11-09 15:46:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2075072347, now seen corresponding path program 1 times [2024-11-09 15:46:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881497512] [2024-11-09 15:46:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:52,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 4 times [2024-11-09 15:46:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764966960] [2024-11-09 15:46:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:46:53,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:46:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash 97266722, now seen corresponding path program 1 times [2024-11-09 15:46:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:46:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956377095] [2024-11-09 15:46:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:46:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:46:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:46:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:46:53,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:05,675 WARN L286 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 375 DAG size of output: 307 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:47:08,543 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:47:08,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:47:08,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:47:08,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:47:08,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:47:08,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:08,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:47:08,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:47:08,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2024-11-09 15:47:08,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:47:08,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:47:08,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:08,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:09,516 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:47:09,517 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:47:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,519 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:47:09,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:09,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:09,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:09,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,553 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:47:09,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:09,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:09,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:09,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,589 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:47:09,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:09,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:09,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:09,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:47:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,616 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:47:09,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,643 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:47:09,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,674 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:47:09,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,709 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:47:09,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,739 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:47:09,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:47:09,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,770 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:47:09,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,796 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:47:09,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-09 15:47:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,823 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:47:09,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:47:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,863 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:47:09,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,899 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:47:09,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:09,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-09 15:47:09,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,930 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:47:09,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,942 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-09 15:47:09,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,949 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-09 15:47:09,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:09,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,971 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:47:09,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:09,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:09,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:09,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:09,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:09,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:09,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:09,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:09,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:09,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:09,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:09,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:09,998 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:09,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:47:10,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-09 15:47:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,023 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-09 15:47:10,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:10,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,048 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:47:10,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-09 15:47:10,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,072 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:47:10,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,097 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:47:10,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-09 15:47:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,120 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:47:10,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,145 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:47:10,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:10,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:10,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:47:10,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,171 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:47:10,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-09 15:47:10,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,195 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:47:10,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:10,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,222 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:47:10,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:47:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,245 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:47:10,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:10,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:10,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:10,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:10,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:47:10,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,270 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:47:10,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:10,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:10,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:10,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:10,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:10,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:10,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:10,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:47:10,294 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:47:10,294 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:47:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:10,296 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:47:10,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:47:10,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:47:10,310 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:47:10,310 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:47:10,310 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1) = 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2024-11-09 15:47:10,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:47:10,330 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-09 15:47:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:10,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:47:10,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:10,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:47:10,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:10,429 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:47:10,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-09 15:47:10,436 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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) Result 18 states and 19 transitions. Complement of second has 2 states. [2024-11-09 15:47:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-09 15:47:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-09 15:47:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2024-11-09 15:47:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 15 letters. Loop has 1 letters. [2024-11-09 15:47:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 16 letters. Loop has 1 letters. [2024-11-09 15:47:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:10,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-09 15:47:10,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:10,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-11-09 15:47:10,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:47:10,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2024-11-09 15:47:10,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:47:10,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:47:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:47:10,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:10,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:47:10,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:47:10,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:47:10,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:47:10,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:47:10,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:47:10,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:47:10,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:47:10 BoogieIcfgContainer [2024-11-09 15:47:10,448 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:47:10,448 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:47:10,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:47:10,448 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:47:10,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:46:44" (3/4) ... [2024-11-09 15:47:10,450 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:47:10,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:47:10,452 INFO L158 Benchmark]: Toolchain (without parser) took 26950.26ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 92.4MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,452 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:47:10,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.03ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 125.8MB in the end (delta: -33.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.03ms. Allocated memory is still 159.4MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,452 INFO L158 Benchmark]: Boogie Preprocessor took 42.10ms. Allocated memory is still 159.4MB. Free memory was 124.2MB in the beginning and 121.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,452 INFO L158 Benchmark]: RCFGBuilder took 360.33ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 105.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,453 INFO L158 Benchmark]: BuchiAutomizer took 25983.46ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 105.4MB in the beginning and 90.2MB in the end (delta: 15.2MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2024-11-09 15:47:10,453 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 264.2MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:47:10,454 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.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.03ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 125.8MB in the end (delta: -33.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.03ms. Allocated memory is still 159.4MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.10ms. Allocated memory is still 159.4MB. Free memory was 124.2MB in the beginning and 121.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.33ms. Allocated memory is still 159.4MB. Free memory was 121.3MB in the beginning and 105.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 25983.46ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 105.4MB in the beginning and 90.2MB in the end (delta: 15.2MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 264.2MB. Free memory is still 90.2MB. 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (39 + ((long long) -2 * c)) and consists of 4 locations. One deterministic module has affine ranking function length and consists of 2 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 25.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 69 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital652 mio100 ax102 hnf100 lsp92 ukn31 mio100 lsp26 div100 bol100 ite100 ukn100 eq161 hnf93 smp100 dnf250 smp83 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:47:10,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:10,674 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-09 15:47:10,876 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