./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:14:01,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:14:01,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-20 22:14:01,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:14:01,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:14:01,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:14:01,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:14:01,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:14:01,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:14:01,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:14:01,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:14:01,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:14:01,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:14:01,406 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:14:01,406 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:14:01,407 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:14:01,407 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:14:01,407 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:14:01,407 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:14:01,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:14:01,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:14:01,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:14:01,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:14:01,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:14:01,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:14:01,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:14:01,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:14:01,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:14:01,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:14:01,413 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:14:01,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:14:01,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:14:01,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:14:01,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:14:01,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:14:01,415 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:14:01,415 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2024-11-20 22:14:01,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:14:01,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:14:01,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:14:01,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:14:01,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:14:01,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-20 22:14:02,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:14:03,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:14:03,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-20 22:14:03,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306508ed7/9fcab91078c144ed9a9c055ab5213e02/FLAGda01578e5 [2024-11-20 22:14:03,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/306508ed7/9fcab91078c144ed9a9c055ab5213e02 [2024-11-20 22:14:03,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:14:03,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:14:03,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:14:03,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:14:03,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:14:03,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495a77a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03, skipping insertion in model container [2024-11-20 22:14:03,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:14:03,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:14:03,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:14:03,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:14:03,455 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:14:03,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03 WrapperNode [2024-11-20 22:14:03,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:14:03,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:14:03,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:14:03,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:14:03,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,489 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 190 [2024-11-20 22:14:03,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:14:03,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:14:03,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:14:03,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:14:03,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,515 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [10, 8, 6, 12, 6]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 20 writes are split as follows [6, 4, 2, 6, 2]. [2024-11-20 22:14:03,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:14:03,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:14:03,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:14:03,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:14:03,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (1/1) ... [2024-11-20 22:14:03,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:03,570 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-20 22:14:03,572 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-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 22:14:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:14:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:14:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:14:03,722 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:14:03,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:14:04,117 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 22:14:04,117 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:14:04,140 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:14:04,140 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 22:14:04,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:14:04 BoogieIcfgContainer [2024-11-20 22:14:04,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:14:04,141 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:14:04,141 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:14:04,153 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:14:04,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:14:04,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:14:03" (1/3) ... [2024-11-20 22:14:04,154 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23eed531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:14:04, skipping insertion in model container [2024-11-20 22:14:04,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:14:04,154 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:14:03" (2/3) ... [2024-11-20 22:14:04,155 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23eed531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:14:04, skipping insertion in model container [2024-11-20 22:14:04,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:14:04,155 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:14:04" (3/3) ... [2024-11-20 22:14:04,161 INFO L332 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-20 22:14:04,208 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:14:04,208 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:14:04,208 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:14:04,210 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:14:04,210 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:14:04,210 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:14:04,210 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:14:04,210 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:14:04,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 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-20 22:14:04,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:14:04,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:04,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:04,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:14:04,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:14:04,241 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:14:04,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 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-20 22:14:04,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:14:04,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:04,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:04,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:14:04,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:14:04,251 INFO L745 eck$LassoCheckResult]: Stem: 21#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 9#L578true assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#0(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#4(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#3(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 20#L558true assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 14#L562-2true [2024-11-20 22:14:04,252 INFO L747 eck$LassoCheckResult]: Loop: 14#L562-2true call f_#t~mem8#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 11#L562true assume !!(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;call f_#t~mem10#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#3(2 * f_#t~mem10#1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem10#1; 14#L562-2true [2024-11-20 22:14:04,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2024-11-20 22:14:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:04,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484695657] [2024-11-20 22:14:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:04,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:04,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2024-11-20 22:14:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513799856] [2024-11-20 22:14:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:04,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:04,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2024-11-20 22:14:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516526723] [2024-11-20 22:14:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:04,867 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-20 22:14:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516526723] [2024-11-20 22:14:04,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516526723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:14:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989089300] [2024-11-20 22:14:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:14:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:14:05,000 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 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 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:05,065 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-20 22:14:05,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2024-11-20 22:14:05,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-20 22:14:05,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 38 transitions. [2024-11-20 22:14:05,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-20 22:14:05,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-20 22:14:05,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2024-11-20 22:14:05,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:14:05,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-20 22:14:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2024-11-20 22:14:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2024-11-20 22:14:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-20 22:14:05,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-20 22:14:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:14:05,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-20 22:14:05,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:14:05,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2024-11-20 22:14:05,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:05,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:05,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:05,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:14:05,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:05,102 INFO L745 eck$LassoCheckResult]: Stem: 98#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 88#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 89#L578 assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#0(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#4(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#3(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 93#L558 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 94#L562-2 call f_#t~mem8#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 99#L562 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 97#L567-2 [2024-11-20 22:14:05,102 INFO L747 eck$LassoCheckResult]: Loop: 97#L567-2 call f_#t~mem11#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 90#L566 assume !f_#t~short13#1; 91#L566-2 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 95#L567 assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1; 97#L567-2 [2024-11-20 22:14:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2024-11-20 22:14:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963169951] [2024-11-20 22:14:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2024-11-20 22:14:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321221716] [2024-11-20 22:14:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:05,166 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-20 22:14:05,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:05,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321221716] [2024-11-20 22:14:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321221716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:14:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391431138] [2024-11-20 22:14:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:05,168 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:14:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:14:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:14:05,169 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-20 22:14:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:05,190 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-20 22:14:05,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2024-11-20 22:14:05,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:05,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2024-11-20 22:14:05,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-20 22:14:05,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-20 22:14:05,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-20 22:14:05,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:14:05,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-20 22:14:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-20 22:14:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-20 22:14:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-20 22:14:05,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-20 22:14:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:14:05,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-20 22:14:05,197 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:14:05,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-20 22:14:05,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:05,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:05,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:05,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:14:05,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:05,199 INFO L745 eck$LassoCheckResult]: Stem: 144#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 134#L578 assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#0(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#4(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#3(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 139#L558 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 140#L562-2 call f_#t~mem8#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 145#L562 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 143#L567-2 [2024-11-20 22:14:05,200 INFO L747 eck$LassoCheckResult]: Loop: 143#L567-2 call f_#t~mem11#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 136#L566 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 137#L566-2 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 141#L567 assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1; 143#L567-2 [2024-11-20 22:14:05,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2024-11-20 22:14:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:05,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069271779] [2024-11-20 22:14:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:05,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:05,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2024-11-20 22:14:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900040754] [2024-11-20 22:14:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2024-11-20 22:14:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:05,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149700987] [2024-11-20 22:14:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:05,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:06,996 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:14:06,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:14:06,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:14:06,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:14:06,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:14:06,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:14:06,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:14:06,998 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2024-11-20 22:14:06,998 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:14:06,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:14:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:07,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:08,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:14:08,280 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:14:08,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,283 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-20 22:14:08,286 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-20 22:14:08,287 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-20 22:14:08,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:14:08,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,325 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-20 22:14:08,326 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-20 22:14:08,327 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-20 22:14:08,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,346 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-20 22:14:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,349 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-20 22:14:08,352 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-20 22:14:08,353 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-20 22:14:08,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,370 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-20 22:14:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,374 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-20 22:14:08,375 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-20 22:14:08,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:08,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,404 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-20 22:14:08,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,406 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-20 22:14:08,407 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-20 22:14:08,408 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-20 22:14:08,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:14:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,429 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-20 22:14:08,430 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-20 22:14:08,431 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-20 22:14:08,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,448 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-20 22:14:08,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,453 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-20 22:14:08,454 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-20 22:14:08,455 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-20 22:14:08,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,473 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-20 22:14:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,474 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-20 22:14:08,475 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-20 22:14:08,477 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-20 22:14:08,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,496 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-20 22:14:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,498 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-20 22:14:08,499 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-20 22:14:08,500 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-20 22:14:08,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,521 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-20 22:14:08,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,527 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-20 22:14:08,531 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-20 22:14:08,532 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-20 22:14:08,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:08,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:08,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:08,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,551 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-20 22:14:08,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,556 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-20 22:14:08,559 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-20 22:14:08,559 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-20 22:14:08,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,579 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-20 22:14:08,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,581 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-20 22:14:08,587 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-20 22:14:08,588 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-20 22:14:08,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,626 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-20 22:14:08,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,630 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-20 22:14:08,635 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-20 22:14:08,636 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-20 22:14:08,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,660 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-20 22:14:08,661 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-20 22:14:08,664 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-20 22:14:08,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,684 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-20 22:14:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,686 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-20 22:14:08,687 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-20 22:14:08,687 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-20 22:14:08,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,714 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-20 22:14:08,715 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-20 22:14:08,716 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-20 22:14:08,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,764 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-20 22:14:08,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,766 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-20 22:14:08,766 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-20 22:14:08,768 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-20 22:14:08,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:14:08,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,792 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-20 22:14:08,794 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-20 22:14:08,794 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-20 22:14:08,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:14:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,829 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:08,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:14:08,833 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-20 22:14:08,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,853 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:08,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:14:08,855 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-20 22:14:08,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:08,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,887 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-20 22:14:08,888 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-20 22:14:08,890 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-20 22:14:08,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:08,910 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-20 22:14:08,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,912 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-20 22:14:08,913 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-20 22:14:08,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-20 22:14:08,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:08,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:08,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:08,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:08,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:08,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:08,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:08,987 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-20 22:14:08,987 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-20 22:14:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:08,991 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-20 22:14:08,992 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-20 22:14:08,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:09,004 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:14:09,005 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:09,005 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_f_~y~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_f_~y~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_1 - 1 >= 0] [2024-11-20 22:14:09,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:09,225 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-20 22:14:09,306 INFO L156 tatePredicateManager]: 54 out of 56 supporting invariants were superfluous and have been removed [2024-11-20 22:14:09,318 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:14:09,318 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:14:09,319 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-20 22:14:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:09,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:14:09,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:09,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 22:14:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:09,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:14:09,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:09,538 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-20 22:14:09,540 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-20 22:14:09,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:09,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 34 transitions. Complement of second has 10 states. [2024-11-20 22:14:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-20 22:14:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-11-20 22:14:09,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:14:09,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:09,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:14:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:09,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-20 22:14:09,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:09,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2024-11-20 22:14:09,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:09,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 33 transitions. [2024-11-20 22:14:09,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-20 22:14:09,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-20 22:14:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-11-20 22:14:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:09,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-20 22:14:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-11-20 22:14:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-20 22:14:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-20 22:14:09,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-20 22:14:09,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-20 22:14:09,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:14:09,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2024-11-20 22:14:09,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:09,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:09,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:09,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:14:09,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:09,620 INFO L745 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 470#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 471#L578 assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#0(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#4(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#3(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 467#L558-1 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 468#L562-5 call f_#t~mem8#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 476#L562-3 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 465#L567-5 [2024-11-20 22:14:09,620 INFO L747 eck$LassoCheckResult]: Loop: 465#L567-5 call f_#t~mem11#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 466#L566-5 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 463#L566-7 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 464#L567-3 assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#0(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1; 465#L567-5 [2024-11-20 22:14:09,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash 891018187, now seen corresponding path program 1 times [2024-11-20 22:14:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754841307] [2024-11-20 22:14:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:09,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash 3266347, now seen corresponding path program 1 times [2024-11-20 22:14:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740336175] [2024-11-20 22:14:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:09,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1225178613, now seen corresponding path program 1 times [2024-11-20 22:14:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573196280] [2024-11-20 22:14:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:09,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:10,853 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:14:10,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:14:10,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:14:10,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:14:10,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:14:10,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:10,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:14:10,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:14:10,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration4_Lasso [2024-11-20 22:14:10,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:14:10,854 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:14:10,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:14:11,921 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:14:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,923 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-20 22:14:11,924 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-20 22:14:11,927 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-20 22:14:11,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:11,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:11,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:11,971 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-20 22:14:11,971 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:14:11,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,973 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-20 22:14:11,974 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-20 22:14:11,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:11,986 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:14:11,987 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:11,987 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_f_~y~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_f_~y~0#1.base) 0)_2 Supporting invariants [1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~d_ref~0#1.base) 0)_1 - 2 >= 0] [2024-11-20 22:14:11,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-20 22:14:12,135 INFO L156 tatePredicateManager]: 54 out of 57 supporting invariants were superfluous and have been removed [2024-11-20 22:14:12,139 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:14:12,140 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:14:12,140 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-20 22:14:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:14:12,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:12,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 22:14:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:14:12,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:12,314 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-20 22:14:12,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-20 22:14:12,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 44 transitions. Complement of second has 10 states. [2024-11-20 22:14:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-20 22:14:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-11-20 22:14:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:14:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:14:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-20 22:14:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2024-11-20 22:14:12,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:12,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2024-11-20 22:14:12,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-20 22:14:12,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:14:12,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2024-11-20 22:14:12,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:12,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-20 22:14:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2024-11-20 22:14:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-20 22:14:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-20 22:14:12,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-20 22:14:12,371 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-20 22:14:12,371 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:14:12,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2024-11-20 22:14:12,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-20 22:14:12,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:12,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:12,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:12,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-20 22:14:12,372 INFO L745 eck$LassoCheckResult]: Stem: 844#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 832#L578 assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#2(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#0(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#4(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#3(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 838#L558 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 839#L562-2 call f_#t~mem8#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#4(f_~k~0#1.base, f_~k~0#1.offset, 4); 845#L562 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 846#L567-2 call f_#t~mem11#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 833#L566 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 834#L566-2 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 840#L567 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 841#L568 [2024-11-20 22:14:12,372 INFO L747 eck$LassoCheckResult]: Loop: 841#L568 call f_#t~mem15#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#2(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#1(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#0(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#3(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#3(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1; 849#L567-2 call f_#t~mem11#1 := read~int#1(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 850#L566 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#0(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 853#L566-2 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 852#L567 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 841#L568 [2024-11-20 22:14:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2024-11-20 22:14:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181916240] [2024-11-20 22:14:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2024-11-20 22:14:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677627647] [2024-11-20 22:14:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:12,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2024-11-20 22:14:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178921336] [2024-11-20 22:14:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-20 22:14:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178921336] [2024-11-20 22:14:12,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178921336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145343412] [2024-11-20 22:14:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,654 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-20 22:14:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 22:14:12,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:12,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:14:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 22:14:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-20 22:14:12,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-20 22:14:12,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 22:14:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:12,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145343412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:12,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-20 22:14:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926054330] [2024-11-20 22:14:12,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 22:14:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 22:14:13,083 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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-20 22:14:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:13,145 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-20 22:14:13,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2024-11-20 22:14:13,146 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:14:13,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2024-11-20 22:14:13,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:14:13,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:14:13,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:14:13,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:14:13,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:14:13,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:14:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:14:13,147 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:14:13,147 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:14:13,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:14:13,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:14:13,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:14:13,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:14:13 BoogieIcfgContainer [2024-11-20 22:14:13,153 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:14:13,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:14:13,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:14:13,154 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:14:13,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:14:04" (3/4) ... [2024-11-20 22:14:13,155 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:14:13,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:14:13,156 INFO L158 Benchmark]: Toolchain (without parser) took 10048.94ms. Allocated memory was 209.7MB in the beginning and 346.0MB in the end (delta: 136.3MB). Free memory was 158.9MB in the beginning and 229.9MB in the end (delta: -71.0MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 173.5MB in the end (delta: -14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.25ms. Allocated memory is still 209.7MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: Boogie Preprocessor took 36.10ms. Allocated memory is still 209.7MB. Free memory was 171.1MB in the beginning and 168.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: RCFGBuilder took 613.90ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 146.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,157 INFO L158 Benchmark]: BuchiAutomizer took 9012.28ms. Allocated memory was 209.7MB in the beginning and 346.0MB in the end (delta: 136.3MB). Free memory was 146.2MB in the beginning and 229.9MB in the end (delta: -83.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-20 22:14:13,158 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 346.0MB. Free memory is still 229.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:14:13,158 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 173.5MB in the end (delta: -14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.25ms. Allocated memory is still 209.7MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.10ms. Allocated memory is still 209.7MB. Free memory was 171.1MB in the beginning and 168.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.90ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 146.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 9012.28ms. Allocated memory was 209.7MB in the beginning and 346.0MB in the end (delta: 136.3MB). Free memory was 146.2MB in the beginning and 229.9MB in the end (delta: -83.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 346.0MB. Free memory is still 229.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 97 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital310 mio100 ax105 hnf100 lsp94 ukn76 mio100 lsp25 div100 bol100 ite100 ukn100 eq166 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-20 22:14:13,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:13,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE