./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_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/ldv-memsafety/memleaks_test17_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 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:47:20,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:47:20,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:47:20,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:47:20,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:47:20,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:47:20,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:47:20,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:47:20,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:47:20,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:47:20,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:47:20,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:47:20,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:47:20,942 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:47:20,943 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:47:20,943 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:47:20,943 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:47:20,944 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:47:20,944 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:47:20,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:47:20,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:47:20,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:47:20,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:47:20,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:47:20,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:47:20,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:47:20,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:47:20,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:47:20,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:47:20,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:47:20,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:47:20,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:47:20,949 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:47:20,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:47:20,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:47:20,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:47:20,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:47:20,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:47:20,951 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:47:20,952 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 -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2024-11-09 15:47:21,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:47:21,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:47:21,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:47:21,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:47:21,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:47:21,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2024-11-09 15:47:22,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:47:22,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:47:22,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2024-11-09 15:47:22,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915c8424c/49d2455de9a44de1a9113c0f82d007c4/FLAGd1272686a [2024-11-09 15:47:23,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915c8424c/49d2455de9a44de1a9113c0f82d007c4 [2024-11-09 15:47:23,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:47:23,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:47:23,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:47:23,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:47:23,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:47:23,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3c4a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23, skipping insertion in model container [2024-11-09 15:47:23,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:47:23,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:47:23,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:47:23,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:47:23,832 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:47:23,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23 WrapperNode [2024-11-09 15:47:23,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:47:23,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:47:23,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:47:23,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:47:23,842 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:47:23" (1/1) ... [2024-11-09 15:47:23,870 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:47:23" (1/1) ... [2024-11-09 15:47:23,901 INFO L138 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 101 [2024-11-09 15:47:23,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:47:23,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:47:23,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:47:23,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:47:23,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,940 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-09 15:47:23,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:47:23,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:47:23,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:47:23,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:47:23,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (1/1) ... [2024-11-09 15:47:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:23,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:24,003 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:47:24,007 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:47:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:47:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:47:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 15:47:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 15:47:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 15:47:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 15:47:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:47:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 15:47:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 15:47:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:47:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:47:24,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:47:24,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:47:24,314 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 15:47:24,314 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:47:24,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:47:24,330 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 15:47:24,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:47:24 BoogieIcfgContainer [2024-11-09 15:47:24,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:47:24,331 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:47:24,331 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:47:24,334 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:47:24,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:47:24,335 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:47:23" (1/3) ... [2024-11-09 15:47:24,336 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d46d130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:47:24, skipping insertion in model container [2024-11-09 15:47:24,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:47:24,336 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:47:23" (2/3) ... [2024-11-09 15:47:24,336 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d46d130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:47:24, skipping insertion in model container [2024-11-09 15:47:24,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:47:24,336 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:47:24" (3/3) ... [2024-11-09 15:47:24,338 INFO L332 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2024-11-09 15:47:24,389 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:47:24,389 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:47:24,389 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:47:24,389 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:47:24,389 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:47:24,389 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:47:24,390 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:47:24,390 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:47:24,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:24,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-11-09 15:47:24,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:24,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:24,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:24,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:47:24,423 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:47:24,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:24,425 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-11-09 15:47:24,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:24,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:24,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:24,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:47:24,433 INFO L745 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 24#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 19#ldv_malloc_returnLabel#1true entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 16#L787true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 10#L788-3true [2024-11-09 15:47:24,434 INFO L747 eck$LassoCheckResult]: Loop: 10#L788-3true assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 2#L788-2true entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 10#L788-3true [2024-11-09 15:47:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-11-09 15:47:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671244324] [2024-11-09 15:47:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:24,739 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:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:47:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671244324] [2024-11-09 15:47:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671244324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:47:24,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:47:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:47:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156297386] [2024-11-09 15:47:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:47:24,752 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:47:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2024-11-09 15:47:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:24,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802195866] [2024-11-09 15:47:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:24,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:24,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:47:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:47:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:47:24,958 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:47:25,055 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-11-09 15:47:25,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2024-11-09 15:47:25,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-11-09 15:47:25,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2024-11-09 15:47:25,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-09 15:47:25,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-09 15:47:25,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2024-11-09 15:47:25,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:25,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:47:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2024-11-09 15:47:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 15:47:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-09 15:47:25,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:47:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:47:25,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:47:25,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:47:25,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-11-09 15:47:25,091 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-11-09 15:47:25,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:25,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:25,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:25,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:47:25,092 INFO L745 eck$LassoCheckResult]: Stem: 85#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 77#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 78#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 72#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 67#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 66#L788-3 [2024-11-09 15:47:25,092 INFO L747 eck$LassoCheckResult]: Loop: 66#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 65#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 66#L788-3 [2024-11-09 15:47:25,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-11-09 15:47:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801510617] [2024-11-09 15:47:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:25,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2024-11-09 15:47:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011984388] [2024-11-09 15:47:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:25,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2024-11-09 15:47:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796021377] [2024-11-09 15:47:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:25,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:25,639 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:47:25,640 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:47:25,640 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:47:25,640 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:47:25,640 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:47:25,640 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:25,640 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:47:25,640 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:47:25,640 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2024-11-09 15:47:25,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:47:25,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:47:25,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:25,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:47:26,184 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:47:26,190 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:47:26,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,194 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:47:26,196 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:47:26,197 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:26,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,230 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:47:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,233 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:47:26,234 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:47:26,235 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:26,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,263 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:47:26,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,266 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:47:26,268 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:47:26,269 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:26,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,300 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:47:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,303 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:47:26,304 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:47:26,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:47:26,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:47:26,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,342 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:47:26,343 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:47:26,345 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:26,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:26,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,379 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:47:26,381 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:47:26,382 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:26,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,415 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:47:26,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,418 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:47:26,419 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:47:26,420 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:26,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:47:26,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,454 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:47:26,455 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:47:26,457 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:26,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:47:26,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,512 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:47:26,514 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:47:26,515 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:26,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,550 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:47:26,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,553 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:47:26,554 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:47:26,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:26,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,588 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:47:26,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,591 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:47:26,592 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:47:26,593 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:26,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,619 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:47:26,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,620 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:47:26,621 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:47:26,622 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:26,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:47:26,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:47:26,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:47:26,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,644 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:47:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,646 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:47:26,647 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:47:26,647 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:26,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:47:26,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,681 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:47:26,685 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:47:26,686 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:26,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:47:26,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,724 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:47:26,725 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:47:26,727 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:26,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,739 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:47:26,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,742 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:47:26,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:47:26,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,764 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:47:26,766 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:47:26,767 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:26,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:47:26,801 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:47:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,803 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:47:26,806 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:47:26,807 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:26,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:47:26,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:47:26,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:47:26,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:47:26,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:47:26,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:47:26,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:47:26,869 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-09 15:47:26,869 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-09 15:47:26,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:47:26,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:26,876 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:47:26,878 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:47:26,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:47:26,896 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:47:26,896 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:47:26,897 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~2#1, ULTIMATE.start_entry_point_~len~0#1) = -1*ULTIMATE.start_entry_point_~i~2#1 + 1*ULTIMATE.start_entry_point_~len~0#1 Supporting invariants [] [2024-11-09 15:47:26,912 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:47:26,921 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:47:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:26,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:47:26,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:26,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:47:26,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:27,015 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:27,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:47:27,021 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:27,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 30 transitions. Complement of second has 5 states. [2024-11-09 15:47:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:47:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-11-09 15:47:27,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:47:27,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:27,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-09 15:47:27,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:27,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-09 15:47:27,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:47:27,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2024-11-09 15:47:27,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:27,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 28 transitions. [2024-11-09 15:47:27,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:47:27,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:47:27,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-11-09 15:47:27,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:27,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-09 15:47:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-11-09 15:47:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 15:47:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-09 15:47:27,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-09 15:47:27,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-09 15:47:27,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:47:27,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-11-09 15:47:27,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:27,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:27,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:27,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:47:27,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:27,076 INFO L745 eck$LassoCheckResult]: Stem: 183#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 176#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 170#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 164#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 165#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 181#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 178#L764-3 [2024-11-09 15:47:27,076 INFO L747 eck$LassoCheckResult]: Loop: 178#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 182#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 177#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 171#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 173#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 178#L764-3 [2024-11-09 15:47:27,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2024-11-09 15:47:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479618307] [2024-11-09 15:47:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:27,145 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:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:47:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479618307] [2024-11-09 15:47:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479618307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:47:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:47:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:47:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712370276] [2024-11-09 15:47:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:47:27,147 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:47:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2024-11-09 15:47:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50823764] [2024-11-09 15:47:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:27,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:27,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:47:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:47:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:47:27,401 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:47:27,421 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-11-09 15:47:27,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-11-09 15:47:27,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:27,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2024-11-09 15:47:27,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:47:27,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:47:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-09 15:47:27,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:27,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:47:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-09 15:47:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-09 15:47:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-09 15:47:27,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:47:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:47:27,431 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:47:27,432 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:47:27,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-09 15:47:27,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:27,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:27,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:27,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:47:27,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:27,434 INFO L745 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 228#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 222#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 216#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 217#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 214#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 215#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 233#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 230#L764-3 [2024-11-09 15:47:27,434 INFO L747 eck$LassoCheckResult]: Loop: 230#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 234#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 229#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 223#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 225#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 230#L764-3 [2024-11-09 15:47:27,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2024-11-09 15:47:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115922430] [2024-11-09 15:47:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:47:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115922430] [2024-11-09 15:47:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115922430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:47:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810247073] [2024-11-09 15:47:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:47:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:27,551 INFO L229 MonitoredProcess]: Starting monitored process 20 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:47:27,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 15:47:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:27,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:47:27,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:27,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:47:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:27,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810247073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:47:27,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:47:27,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 15:47:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345287958] [2024-11-09 15:47:27,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:47:27,707 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:47:27,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2024-11-09 15:47:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151422536] [2024-11-09 15:47:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:27,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:27,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:27,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:47:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:47:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 15:47:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-09 15:47:27,992 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:47:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:47:28,047 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-09 15:47:28,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2024-11-09 15:47:28,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:28,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2024-11-09 15:47:28,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:47:28,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:47:28,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-11-09 15:47:28,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:28,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 15:47:28,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-11-09 15:47:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 15:47:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-09 15:47:28,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 15:47:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:47:28,056 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 15:47:28,057 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:47:28,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2024-11-09 15:47:28,057 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:28,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:28,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:28,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:47:28,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:28,058 INFO L745 eck$LassoCheckResult]: Stem: 352#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 343#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 340#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 331#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 332#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 348#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 349#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 329#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 330#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 356#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 355#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 354#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 353#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 350#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 345#L764-3 [2024-11-09 15:47:28,058 INFO L747 eck$LassoCheckResult]: Loop: 345#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 351#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 344#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 337#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 339#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 345#L764-3 [2024-11-09 15:47:28,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2024-11-09 15:47:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553975959] [2024-11-09 15:47:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:47:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:47:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553975959] [2024-11-09 15:47:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553975959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:47:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502566292] [2024-11-09 15:47:28,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:47:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:47:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:47:28,218 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:47:28,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 15:47:28,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:47:28,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:47:28,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:47:28,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:47:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:28,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:47:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:47:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502566292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:47:28,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:47:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-09 15:47:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127535995] [2024-11-09 15:47:28,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:47:28,472 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:47:28,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2024-11-09 15:47:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759556658] [2024-11-09 15:47:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:47:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 15:47:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-09 15:47:28,720 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:47:28,853 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 15:47:28,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-09 15:47:28,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:28,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 15:47:28,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:47:28,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:47:28,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2024-11-09 15:47:28,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:47:28,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 15:47:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2024-11-09 15:47:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 15:47:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:47:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 15:47:28,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 15:47:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:47:28,862 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 15:47:28,862 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:47:28,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2024-11-09 15:47:28,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-09 15:47:28,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:47:28,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:47:28,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:47:28,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:47:28,868 INFO L745 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 526#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 527#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 521#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 515#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 516#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 532#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 533#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 513#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 514#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 552#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 551#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 550#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 549#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 548#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 547#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 546#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 545#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 544#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 543#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 542#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 541#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 540#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 539#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 538#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 537#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 534#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 529#L764-3 [2024-11-09 15:47:28,868 INFO L747 eck$LassoCheckResult]: Loop: 529#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 535#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 528#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 522#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 524#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 529#L764-3 [2024-11-09 15:47:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2024-11-09 15:47:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:28,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717010429] [2024-11-09 15:47:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:28,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2024-11-09 15:47:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340148434] [2024-11-09 15:47:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:28,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:47:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:47:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2024-11-09 15:47:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:47:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387485737] [2024-11-09 15:47:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:47:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:47:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:29,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:47:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:47:29,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:41,659 WARN L286 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 342 DAG size of output: 294 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:48:42,246 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:48:42,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:48:42,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:48:42,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:48:42,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:48:42,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:42,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:48:42,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:48:42,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration6_Lasso [2024-11-09 15:48:42,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:48:42,247 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:48:42,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:42,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:42,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:48:43,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:48:43,743 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:48:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,746 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:48:43,747 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:48:43,749 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:48:43,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:43,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:43,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:43,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,772 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:48:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,773 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:48:43,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:48:43,775 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:48:43,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:43,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:43,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:43,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:48:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,800 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:48:43,800 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:48:43,802 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:48:43,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:48:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,834 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:48:43,838 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:48:43,841 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:48:43,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,872 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:48:43,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,875 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:48:43,876 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:48:43,878 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:48:43,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,913 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:48:43,915 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:48:43,915 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:48:43,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,945 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:48:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,947 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:48:43,948 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:48:43,950 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:48:43,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:43,973 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:48:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:43,975 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:48:43,977 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:48:43,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:48:43,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:43,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:43,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:43,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:43,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:43,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:43,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,007 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:48:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,009 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:48:44,010 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:48:44,011 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:48:44,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-09 15:48:44,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,037 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:48:44,038 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:48:44,038 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:48:44,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,081 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:48:44,083 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:48:44,084 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:48:44,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:48:44,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,119 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:48:44,119 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:48:44,120 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:48:44,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,146 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:48:44,146 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:48:44,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:48:44,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,174 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:48:44,175 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:48:44,175 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:48:44,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,198 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:48:44,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,200 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:48:44,201 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:48:44,202 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:48:44,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,226 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:48:44,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,228 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:48:44,228 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:48:44,229 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:48:44,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-09 15:48:44,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,253 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:48:44,255 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:48:44,256 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:48:44,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,281 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:48:44,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,283 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:48:44,284 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:48:44,285 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:48:44,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,311 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:48:44,312 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:48:44,312 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:48:44,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-09 15:48:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,343 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:48:44,345 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:48:44,347 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:48:44,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,382 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:48:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,384 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:48:44,385 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:48:44,386 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:48:44,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,414 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:48:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,415 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:48:44,416 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:48:44,417 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:48:44,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,443 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:48:44,444 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:48:44,444 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:48:44,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,472 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:48:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,474 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:48:44,474 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:48:44,475 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:48:44,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,505 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:48:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,507 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:48:44,509 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:48:44,510 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:48:44,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,534 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:48:44,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,536 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:48:44,537 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:48:44,537 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:48:44,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,563 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:48:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,565 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:48:44,565 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:48:44,566 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:48:44,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,589 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:48:44,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,590 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:48:44,591 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:48:44,592 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:48:44,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,613 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:48:44,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,614 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:48:44,615 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:48:44,615 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:48:44,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,626 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:48:44,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,628 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:48:44,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,643 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:48:44,644 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:48:44,644 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:48:44,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-09 15:48:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,675 INFO L229 MonitoredProcess]: Starting monitored process 52 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:48:44,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-09 15:48:44,677 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:48:44,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-09 15:48:44,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,710 INFO L229 MonitoredProcess]: Starting monitored process 53 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:48:44,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:48:44,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:48:44,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-09 15:48:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,736 INFO L229 MonitoredProcess]: Starting monitored process 54 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:48:44,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:48:44,737 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:48:44,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:48:44,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:48:44,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:48:44,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-09 15:48:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,761 INFO L229 MonitoredProcess]: Starting monitored process 55 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:48:44,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-09 15:48:44,762 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:48:44,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:48:44,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-09 15:48:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,788 INFO L229 MonitoredProcess]: Starting monitored process 56 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:48:44,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-09 15:48:44,789 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:48:44,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:48:44,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:48:44,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:48:44,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:48:44,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:48:44,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:48:44,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:48:44,837 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:48:44,838 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:48:44,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:48:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:48:44,840 INFO L229 MonitoredProcess]: Starting monitored process 57 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:48:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-09 15:48:44,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:48:44,860 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:48:44,860 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:48:44,860 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~len#1, ULTIMATE.start_alloc_17_~i~0#1) = 1*ULTIMATE.start_alloc_17_~len#1 - 1*ULTIMATE.start_alloc_17_~i~0#1 Supporting invariants [] [2024-11-09 15:48:44,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-09 15:48:44,892 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:48:44,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:48:44,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:48:44,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:48:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:48:45,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:48:45,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:48:45,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-09 15:48:45,067 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:48:45,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:48:45,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:48:45,099 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 46 states and 54 transitions. Complement of second has 5 states. [2024-11-09 15:48:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:48:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:48:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-09 15:48:45,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 5 letters. [2024-11-09 15:48:45,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:48:45,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 32 letters. Loop has 5 letters. [2024-11-09 15:48:45,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:48:45,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 10 letters. [2024-11-09 15:48:45,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:48:45,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-09 15:48:45,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 52 transitions. [2024-11-09 15:48:45,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:48:45,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:48:45,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2024-11-09 15:48:45,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:48:45,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 15:48:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2024-11-09 15:48:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 15:48:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 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:48:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-09 15:48:45,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 15:48:45,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 15:48:45,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:48:45,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2024-11-09 15:48:45,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:48:45,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:48:45,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:48:45,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:48:45,114 INFO L745 eck$LassoCheckResult]: Stem: 766#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 753#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 754#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 751#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 741#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 742#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 760#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 761#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 739#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 740#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 782#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 781#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 780#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 779#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 778#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 777#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 776#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 775#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 774#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 773#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 772#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 771#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 770#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 769#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 768#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 767#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 762#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 763#L764-3 assume !(alloc_17_~i~0#1 < alloc_17_~len#1); 745#L764-4 alloc_17_#res#1 := 0; 746#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 744#L779-3 [2024-11-09 15:48:45,114 INFO L747 eck$LassoCheckResult]: Loop: 744#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 743#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 744#L779-3 [2024-11-09 15:48:45,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2024-11-09 15:48:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577060182] [2024-11-09 15:48:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:48:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:48:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:48:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577060182] [2024-11-09 15:48:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577060182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:48:45,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:48:45,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:48:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418063742] [2024-11-09 15:48:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:48:45,252 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:48:45,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2024-11-09 15:48:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210142772] [2024-11-09 15:48:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:48:45,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:48:45,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:48:45,299 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:48:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:48:45,328 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-09 15:48:45,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2024-11-09 15:48:45,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 61 transitions. [2024-11-09 15:48:45,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-09 15:48:45,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-09 15:48:45,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 61 transitions. [2024-11-09 15:48:45,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:48:45,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-09 15:48:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 61 transitions. [2024-11-09 15:48:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-09 15:48:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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:48:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-09 15:48:45,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-09 15:48:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:48:45,333 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-09 15:48:45,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:48:45,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2024-11-09 15:48:45,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:48:45,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:48:45,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:48:45,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:48:45,335 INFO L745 eck$LassoCheckResult]: Stem: 870#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 859#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 852#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 846#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 847#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 844#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 845#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 865#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 887#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 886#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 885#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 884#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 883#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 882#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 881#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 880#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 879#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 878#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 877#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 876#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 875#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 874#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 873#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 872#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 871#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 866#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 867#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 868#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 860#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 853#L766 assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0; 854#alloc_17_err#1 alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1; 857#L771-3 [2024-11-09 15:48:45,335 INFO L747 eck$LassoCheckResult]: Loop: 857#L771-3 assume !!(alloc_17_~j~0#1 >= 0);call alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset := read~$Pointer$#1(alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4);call ULTIMATE.dealloc(alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset);havoc alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset;call write~$Pointer$#1(0, 0, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4); 864#L771-2 alloc_17_#t~post45#1 := alloc_17_~j~0#1;alloc_17_~j~0#1 := alloc_17_#t~post45#1 - 1;havoc alloc_17_#t~post45#1; 857#L771-3 [2024-11-09 15:48:45,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2024-11-09 15:48:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246686026] [2024-11-09 15:48:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2024-11-09 15:48:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276777788] [2024-11-09 15:48:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2024-11-09 15:48:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65825047] [2024-11-09 15:48:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:48:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:48:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:48:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65825047] [2024-11-09 15:48:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65825047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:48:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:48:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:48:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074996045] [2024-11-09 15:48:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:48:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:48:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:48:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:48:45,605 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:48:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:48:45,633 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-09 15:48:45,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2024-11-09 15:48:45,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 62 transitions. [2024-11-09 15:48:45,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:48:45,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:48:45,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2024-11-09 15:48:45,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:48:45,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-09 15:48:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2024-11-09 15:48:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-09 15:48:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 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:48:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-09 15:48:45,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 15:48:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:48:45,638 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 15:48:45,638 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:48:45,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2024-11-09 15:48:45,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:48:45,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:48:45,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:48:45,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:48:45,640 INFO L745 eck$LassoCheckResult]: Stem: 977#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 965#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 958#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 952#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 953#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 950#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 951#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 972#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 998#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 997#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 996#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 995#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 994#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 993#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 992#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 991#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 990#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 989#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 988#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 987#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 986#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 985#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 983#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 980#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 979#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 973#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 974#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 976#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 967#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 961#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 962#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 968#L764-3 assume !(alloc_17_~i~0#1 < alloc_17_~len#1); 956#L764-4 alloc_17_#res#1 := 0; 957#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 955#L779-3 [2024-11-09 15:48:45,641 INFO L747 eck$LassoCheckResult]: Loop: 955#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 954#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 955#L779-3 [2024-11-09 15:48:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2024-11-09 15:48:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644235588] [2024-11-09 15:48:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:48:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:48:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:48:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644235588] [2024-11-09 15:48:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644235588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:48:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:48:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:48:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689135576] [2024-11-09 15:48:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:48:45,785 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:48:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2024-11-09 15:48:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328598468] [2024-11-09 15:48:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:48:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:48:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:48:45,837 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:48:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:48:45,852 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-09 15:48:45,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2024-11-09 15:48:45,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 60 transitions. [2024-11-09 15:48:45,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-09 15:48:45,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-09 15:48:45,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 60 transitions. [2024-11-09 15:48:45,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:48:45,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-09 15:48:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 60 transitions. [2024-11-09 15:48:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-09 15:48:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 48 states have internal predecessors, (56), 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:48:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-09 15:48:45,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-09 15:48:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:48:45,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-09 15:48:45,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:48:45,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2024-11-09 15:48:45,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-09 15:48:45,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:48:45,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:48:45,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:48:45,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:48:45,860 INFO L745 eck$LassoCheckResult]: Stem: 1091#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 1077#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 1073#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 1063#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 1064#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1061#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1062#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1085#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1108#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1107#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1106#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1105#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1104#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1103#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1102#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1101#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1100#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1099#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1098#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1097#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1096#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1095#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1094#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1093#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1092#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 1086#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 1087#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 1088#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 1078#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 1079#L766 assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0; 1074#alloc_17_err#1 alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1; 1075#L771-3 assume !(alloc_17_~j~0#1 >= 0); 1082#L771-4 alloc_17_#res#1 := 3; 1068#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 1066#L779-3 [2024-11-09 15:48:45,861 INFO L747 eck$LassoCheckResult]: Loop: 1066#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 1065#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 1066#L779-3 [2024-11-09 15:48:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2024-11-09 15:48:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819007567] [2024-11-09 15:48:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,905 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2024-11-09 15:48:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270654879] [2024-11-09 15:48:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:48:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:48:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2024-11-09 15:48:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:48:45,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113345118] [2024-11-09 15:48:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:48:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:48:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:48:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:48:45,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace