./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8e64c1324249ca9b9e3c019cfc2046542af7b26 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:35,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:35,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:35,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:35,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:35,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:35,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:35,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:35,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:35,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:35,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:35,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:35,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:35,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:35,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:35,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:35,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:35,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:35,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:35,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:35,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:35,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:35,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:35,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:35,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:35,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:35,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:35,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:35,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:35,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:35,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:35,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:35,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:35,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:35,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:35,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:35,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:35,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:35,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:35,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:35,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:35,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:35,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:35,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:35,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:35,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:35,597 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:35,597 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:35,597 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:35,597 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:35,598 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:35,598 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:35,598 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:35,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:35,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:35,599 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:35,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:35,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:35,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:35,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:35,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:35,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:35,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:35,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:35,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:35,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:35,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:35,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:35,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:35,603 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:35,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:35,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:35,604 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:35,605 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:35,606 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8e64c1324249ca9b9e3c019cfc2046542af7b26 [2019-11-28 03:52:36,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:36,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:36,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:36,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:36,026 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:36,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-28 03:52:36,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bdd3ea3/c143983569ed47048be6613c8b928ba8/FLAG9ffb04fda [2019-11-28 03:52:36,585 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:36,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2019-11-28 03:52:36,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bdd3ea3/c143983569ed47048be6613c8b928ba8/FLAG9ffb04fda [2019-11-28 03:52:36,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87bdd3ea3/c143983569ed47048be6613c8b928ba8 [2019-11-28 03:52:36,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:36,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:36,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:36,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:36,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:36,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:36" (1/1) ... [2019-11-28 03:52:36,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:36, skipping insertion in model container [2019-11-28 03:52:36,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:36" (1/1) ... [2019-11-28 03:52:36,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:37,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:37,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:37,555 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:37,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:37,674 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:37,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37 WrapperNode [2019-11-28 03:52:37,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:37,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:37,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:37,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:37,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:37,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:37,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:37,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:37,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... [2019-11-28 03:52:37,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:37,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:37,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:37,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:37,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:37,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:37,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:37,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:37,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:38,113 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:38,114 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:52:38,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:38 BoogieIcfgContainer [2019-11-28 03:52:38,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:38,116 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:38,117 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:38,130 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:38,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:38,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:36" (1/3) ... [2019-11-28 03:52:38,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1839c6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:38, skipping insertion in model container [2019-11-28 03:52:38,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:38,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:37" (2/3) ... [2019-11-28 03:52:38,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1839c6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:38, skipping insertion in model container [2019-11-28 03:52:38,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:38,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:38" (3/3) ... [2019-11-28 03:52:38,137 INFO L371 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2019-11-28 03:52:38,213 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:38,213 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:38,213 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:38,213 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:38,214 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:38,214 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:38,214 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:38,214 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:38,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 03:52:38,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:38,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:38,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:38,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:52:38,253 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:38,253 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:38,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 03:52:38,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:38,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:38,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:38,256 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:52:38,256 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:38,262 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L515true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 5#L515-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 14#L517true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 15#L520-3true [2019-11-28 03:52:38,263 INFO L796 eck$LassoCheckResult]: Loop: 15#L520-3true assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 12#L520-2true main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 15#L520-3true [2019-11-28 03:52:38,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:52:38,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090449] [2019-11-28 03:52:38,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-28 03:52:38,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329601782] [2019-11-28 03:52:38,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-28 03:52:38,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:38,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431471466] [2019-11-28 03:52:38,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:38,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:38,766 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-11-28 03:52:38,836 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:38,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:38,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:38,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:38,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:38,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:38,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:38,838 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:38,838 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2019-11-28 03:52:38,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:38,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:38,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,055 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-28 03:52:39,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:39,459 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:39,465 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:39,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:39,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:39,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:39,949 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:52:39,949 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:39,966 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:39,966 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:39,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-28 03:52:39,988 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:40,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:40,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:40,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:52:40,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-28 03:52:40,215 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 31 states and 41 transitions. Complement of second has 7 states. [2019-11-28 03:52:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 03:52:40,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:52:40,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 03:52:40,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 03:52:40,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2019-11-28 03:52:40,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:40,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2019-11-28 03:52:40,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:52:40,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 03:52:40,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 03:52:40,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:40,251 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:52:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 03:52:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 03:52:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:52:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 03:52:40,282 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 03:52:40,282 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 03:52:40,282 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:40,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 03:52:40,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:40,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:40,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:40,287 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:40,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:40,288 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 105#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 106#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 110#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 113#L520-3 assume !(main_~k~0 < main_~length~0); 109#L525-2 [2019-11-28 03:52:40,288 INFO L796 eck$LassoCheckResult]: Loop: 109#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 108#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 109#L525-2 [2019-11-28 03:52:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2019-11-28 03:52:40,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595826811] [2019-11-28 03:52:40,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:40,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595826811] [2019-11-28 03:52:40,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:40,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:40,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684878842] [2019-11-28 03:52:40,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2019-11-28 03:52:40,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055919919] [2019-11-28 03:52:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:40,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:40,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:40,513 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 03:52:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:40,549 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-28 03:52:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:40,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-28 03:52:40,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:40,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-28 03:52:40,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:52:40,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 03:52:40,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-28 03:52:40,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:40,554 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-28 03:52:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-28 03:52:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 03:52:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:52:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-28 03:52:40,556 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 03:52:40,556 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-28 03:52:40,556 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:40,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-28 03:52:40,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:40,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:40,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:40,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:40,559 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:40,559 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 135#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 138#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 141#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 139#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 140#L520-3 assume !(main_~k~0 < main_~length~0); 137#L525-2 [2019-11-28 03:52:40,560 INFO L796 eck$LassoCheckResult]: Loop: 137#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 136#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 137#L525-2 [2019-11-28 03:52:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2019-11-28 03:52:40,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594028977] [2019-11-28 03:52:40,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2019-11-28 03:52:40,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142032977] [2019-11-28 03:52:40,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2019-11-28 03:52:40,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239940399] [2019-11-28 03:52:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:41,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239940399] [2019-11-28 03:52:41,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578767667] [2019-11-28 03:52:41,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:41,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:52:41,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:41,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing 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 11 [2019-11-28 03:52:41,132 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:41,144 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:41,145 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:41,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-11-28 03:52:41,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:41,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-28 03:52:41,195 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 03:52:41,209 INFO L588 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size [2019-11-28 03:52:41,209 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:41,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-28 03:52:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:41,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:41,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-28 03:52:41,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31366535] [2019-11-28 03:52:41,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:52:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:52:41,283 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-28 03:52:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:41,514 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 03:52:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:52:41,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-28 03:52:41,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:41,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2019-11-28 03:52:41,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:52:41,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 03:52:41,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-11-28 03:52:41,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:41,517 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-28 03:52:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-11-28 03:52:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 03:52:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:52:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-11-28 03:52:41,520 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 03:52:41,520 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-28 03:52:41,520 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:41,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-11-28 03:52:41,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:41,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:41,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:41,522 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:41,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:41,522 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_~k~0, main_#t~mem8, main_#t~mem9, main_#t~post10.base, main_#t~post10.offset, main_#t~mem6, main_#t~mem7, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 210#L515 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 212#L515-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 215#L517 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset;main_~k~0 := 0; 218#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 216#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 217#L520-3 assume !!(main_~k~0 < main_~length~0);call write~int(main_#t~nondet5, main_~arr~0.base, main_~arr~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet5; 219#L520-2 main_#t~post4 := main_~k~0;main_~k~0 := 1 + main_#t~post4;havoc main_#t~post4; 220#L520-3 assume !(main_~k~0 < main_~length~0); 214#L525-2 [2019-11-28 03:52:41,523 INFO L796 eck$LassoCheckResult]: Loop: 214#L525-2 call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 213#L525 assume !!(main_#t~mem6 != main_#t~mem7);havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem8 + main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10.base, main_#t~post10.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post10.base, 4 + main_#t~post10.offset;havoc main_#t~post10.base, main_#t~post10.offset; 214#L525-2 [2019-11-28 03:52:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2019-11-28 03:52:41,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284272607] [2019-11-28 03:52:41,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,578 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2019-11-28 03:52:41,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647572813] [2019-11-28 03:52:41,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2019-11-28 03:52:41,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930020624] [2019-11-28 03:52:41,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:41,894 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-11-28 03:52:41,941 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:41,942 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:41,942 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:41,942 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:41,942 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:41,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:41,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:41,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:41,942 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2019-11-28 03:52:41,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:41,943 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:41,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:41,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:41,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:41,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:42,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:42,564 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:42,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:42,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:42,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:42,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:42,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:42,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:42,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:42,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:42,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:42,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:42,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:42,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:42,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:42,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:42,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:42,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:42,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:42,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:42,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:42,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:42,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:42,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:42,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:42,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:42,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:42,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:42,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:42,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:42,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:42,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:42,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:42,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:42,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:42,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:42,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:42,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:42,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:42,738 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-28 03:52:42,739 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:42,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:42,749 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:42,749 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:42,749 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_2) = -1*ULTIMATE.start_main_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3.base)_2 Supporting invariants [] [2019-11-28 03:52:42,764 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:52:42,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:42,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:52:42,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:42,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:52:42,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:42,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 03:52:42,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-28 03:52:42,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 14 states and 17 transitions. Complement of second has 6 states. [2019-11-28 03:52:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:52:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 03:52:42,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:52:42,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:42,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:52:42,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:42,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:52:42,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:42,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-28 03:52:42,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:42,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-11-28 03:52:42,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:52:42,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:52:42,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:52:42,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:42,944 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:42,945 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:42,946 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:42,946 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:42,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:52:42,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:42,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:52:42,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:52:42 BoogieIcfgContainer [2019-11-28 03:52:42,965 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:52:42,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:52:42,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:52:42,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:52:42,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:38" (3/4) ... [2019-11-28 03:52:42,975 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:52:42,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:52:42,977 INFO L168 Benchmark]: Toolchain (without parser) took 6031.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 957.7 MB in the beginning and 912.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:42,979 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:42,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:42,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:42,984 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:42,986 INFO L168 Benchmark]: RCFGBuilder took 356.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:42,988 INFO L168 Benchmark]: BuchiAutomizer took 4848.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 912.6 MB in the end (delta: 203.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:42,989 INFO L168 Benchmark]: Witness Printer took 10.04 ms. Allocated memory is still 1.3 GB. Free memory is still 912.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:42,995 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 356.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4848.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 912.6 MB in the end (delta: 203.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. * Witness Printer took 10.04 ms. Allocated memory is still 1.3 GB. Free memory is still 912.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * k + length and consists of 5 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 60 SDslu, 20 SDs, 0 SdLazy, 87 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax113 hnf98 lsp83 ukn79 mio100 lsp61 div100 bol100 ite100 ukn100 eq170 hnf91 smp98 dnf100 smp100 tf100 neg100 sie103 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...