./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 64bit --witnessprinter.graph.data.programhash f1115824e83a2d445d70fc62014a99239a945a9c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:56:53,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:56:53,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:56:53,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:56:53,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:56:53,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:56:53,554 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:56:53,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:56:53,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:56:53,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:56:53,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:56:53,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:56:53,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:56:53,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:56:53,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:56:53,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:56:53,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:56:53,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:56:53,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:56:53,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:56:53,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:56:53,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:56:53,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:56:53,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:56:53,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:56:53,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:56:53,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:56:53,604 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:56:53,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:56:53,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:56:53,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:56:53,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:56:53,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:56:53,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:56:53,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:56:53,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:56:53,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:56:53,635 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:56:53,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:56:53,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:56:53,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:56:53,642 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:56:53,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:56:53,642 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:56:53,643 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:56:53,644 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:56:53,644 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:56:53,644 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:56:53,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:56:53,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:56:53,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:56:53,646 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:56:53,647 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:56:53,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:56:53,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:56:53,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:56:53,647 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:56:53,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:56:53,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:56:53,648 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:56:53,649 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:56:53,649 INFO L133 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1115824e83a2d445d70fc62014a99239a945a9c [2019-01-01 21:56:53,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:56:53,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:56:53,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:56:53,713 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:56:53,713 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:56:53,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i [2019-01-01 21:56:53,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f955a6f/f018aa9c81f84fbabd0eb263d594ec8d/FLAG8f0b36a65 [2019-01-01 21:56:54,376 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:56:54,379 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i [2019-01-01 21:56:54,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f955a6f/f018aa9c81f84fbabd0eb263d594ec8d/FLAG8f0b36a65 [2019-01-01 21:56:54,598 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f955a6f/f018aa9c81f84fbabd0eb263d594ec8d [2019-01-01 21:56:54,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:56:54,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:56:54,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:56:54,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:56:54,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:56:54,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:56:54" (1/1) ... [2019-01-01 21:56:54,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69652895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:54, skipping insertion in model container [2019-01-01 21:56:54,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:56:54" (1/1) ... [2019-01-01 21:56:54,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:56:54,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:56:55,057 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:56:55,074 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:56:55,156 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:56:55,321 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:56:55,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55 WrapperNode [2019-01-01 21:56:55,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:56:55,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:56:55,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:56:55,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:56:55,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:56:55,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:56:55,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:56:55,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:56:55,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (1/1) ... [2019-01-01 21:56:55,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:56:55,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:56:55,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:56:55,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:56:55,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (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-01-01 21:56:55,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:56:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:56:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:56:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:56:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:56:55,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:56:56,002 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:56:56,002 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:56:56,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:56:56 BoogieIcfgContainer [2019-01-01 21:56:56,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:56:56,004 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:56:56,004 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:56:56,008 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:56:56,009 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:56:56,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:56:54" (1/3) ... [2019-01-01 21:56:56,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b2ced4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:56:56, skipping insertion in model container [2019-01-01 21:56:56,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:56:56,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:56:55" (2/3) ... [2019-01-01 21:56:56,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b2ced4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:56:56, skipping insertion in model container [2019-01-01 21:56:56,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:56:56,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:56:56" (3/3) ... [2019-01-01 21:56:56,016 INFO L375 chiAutomizerObserver]: Analyzing ICFG array06_alloca_true-termination.c.i [2019-01-01 21:56:56,083 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:56:56,084 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:56:56,084 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:56:56,084 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:56:56,085 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:56:56,085 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:56:56,085 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:56:56,085 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:56:56,085 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:56:56,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:56:56,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:56:56,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:56:56,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:56:56,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:56:56,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:56:56,131 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:56:56,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:56:56,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:56:56,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:56:56,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:56:56,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:56:56,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:56:56,141 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-01-01 21:56:56,142 INFO L796 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-01-01 21:56:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 21:56:56,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-01 21:56:56,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-01 21:56:56,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:56,754 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 21:56:56,861 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:56:56,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:56:56,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:56:56,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:56:56,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:56:56,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:56:56,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:56:56,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:56:56,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:56:56,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:56:56,864 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:56:56,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:56,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:56,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-01-01 21:56:56,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:56,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-01-01 21:56:57,208 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 21:56:57,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:57,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:57,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:57,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:57,567 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:56:57,684 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:56:57,792 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:56:58,177 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:56:58,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:56:58,218 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:56:58,220 INFO L122 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-01-01 21:56:58,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:56:58,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:56:58,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:56:58,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:56:58,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:56:58,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:56:58,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:56:58,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:56:58,230 INFO L122 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-01-01 21:56:58,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:56:58,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:56:58,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:56:58,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:56:58,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:56:58,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:56:58,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:56:58,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:56:58,234 INFO L122 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-01-01 21:56:58,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:56:58,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:56:58,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:56:58,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:56:58,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:56:58,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:56:58,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:56:58,244 INFO L122 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-01-01 21:56:58,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:56:58,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:56:58,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:56:58,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:56:58,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:56:58,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:56:58,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:56:58,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:56:58,251 INFO L122 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-01-01 21:56:58,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:56:58,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:56:58,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:56:58,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:56:58,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:56:58,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:56:58,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:56:58,406 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:56:58,406 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:56:58,409 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:56:58,412 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:56:58,413 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:56:58,413 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-01-01 21:56:58,444 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:56:58,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:56:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:56:58,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:56:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:56:58,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:56:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:56:58,612 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-01-01 21:56:58,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-01 21:56:58,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-01-01 21:56:58,745 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-01-01 21:56:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:56:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 21:56:58,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:56:58,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:56:58,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:56:58,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:56:58,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:56:58,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:56:58,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 21:56:58,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:56:58,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-01-01 21:56:58,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:56:58,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:56:58,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:56:58,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:56:58,771 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:56:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:56:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:56:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:56:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:56:58,802 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:56:58,802 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:56:58,802 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:56:58,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:56:58,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:56:58,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:56:58,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:56:58,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:56:58,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:56:58,804 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-01-01 21:56:58,804 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 103#L374-2 [2019-01-01 21:56:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-01 21:56:58,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:58,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:56:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:56:58,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:56:58,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:56:58,885 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:56:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-01-01 21:56:58,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:58,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:56:58,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:56:58,984 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:56:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:56:59,018 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:56:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:56:59,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:56:59,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:56:59,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 21:56:59,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:56:59,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:56:59,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 21:56:59,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:56:59,023 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 21:56:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 21:56:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:56:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:56:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 21:56:59,024 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:56:59,025 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:56:59,025 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:56:59,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 21:56:59,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:56:59,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:56:59,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:56:59,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:56:59,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:56:59,027 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-01-01 21:56:59,027 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 131#L374-2 [2019-01-01 21:56:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-01-01 21:56:59,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-01-01 21:56:59,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:56:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:56:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-01-01 21:56:59,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:56:59,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:56:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:56:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:56:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:56:59,303 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:56:59,576 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-01 21:56:59,644 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:56:59,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:56:59,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:56:59,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:56:59,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:56:59,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:56:59,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:56:59,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:56:59,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:56:59,649 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:56:59,649 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:56:59,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,845 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-01 21:56:59,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:56:59,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:00,231 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:57:00,232 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:57:00,232 INFO L122 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-01-01 21:57:00,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,242 INFO L122 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-01-01 21:57:00,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,250 INFO L122 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-01-01 21:57:00,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:00,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,266 INFO L122 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-01-01 21:57:00,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,276 INFO L122 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-01-01 21:57:00,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:00,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,290 INFO L122 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-01-01 21:57:00,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:00,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,353 INFO L122 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-01-01 21:57:00,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,355 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:57:00,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,358 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:57:00,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,369 INFO L122 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-01-01 21:57:00,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:00,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,380 INFO L122 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-01-01 21:57:00,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,383 INFO L122 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-01-01 21:57:00,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,386 INFO L122 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-01-01 21:57:00,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:00,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:00,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,396 INFO L122 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-01-01 21:57:00,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:00,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:00,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,400 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 21:57:00,401 INFO L122 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-01-01 21:57:00,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:00,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,407 INFO L122 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-01-01 21:57:00,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,408 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,408 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:00,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,413 INFO L122 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-01-01 21:57:00,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,414 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,415 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:00,416 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:00,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,421 INFO L122 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-01-01 21:57:00,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:00,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,426 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:00,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:00,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,427 INFO L122 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-01-01 21:57:00,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,433 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:00,433 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:00,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:00,436 INFO L122 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-01-01 21:57:00,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:00,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:00,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:00,437 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:00,441 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:00,441 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:00,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:57:00,524 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 21:57:00,524 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 21:57:00,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:57:00,526 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-01-01 21:57:00,527 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:57:00,527 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 21:57:00,564 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:57:00,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:00,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:00,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:00,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:00,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:57:00,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:57:00,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:57:00,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2019-01-01 21:57:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 21:57:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:57:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-01-01 21:57:00,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:57:00,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:00,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-01 21:57:00,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:00,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:57:00,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:00,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:57:00,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:57:00,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-01 21:57:00,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:57:00,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:57:00,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:57:00,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:57:00,680 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:00,680 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:00,680 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:00,680 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:57:00,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:57:00,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:57:00,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:57:00,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:57:00 BoogieIcfgContainer [2019-01-01 21:57:00,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:57:00,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:57:00,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:57:00,688 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:57:00,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:56:56" (3/4) ... [2019-01-01 21:57:00,691 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:57:00,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:57:00,692 INFO L168 Benchmark]: Toolchain (without parser) took 6089.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.4 MB in the beginning and 810.3 MB in the end (delta: 141.1 MB). Peak memory consumption was 240.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:00,694 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:57:00,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:00,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:00,697 INFO L168 Benchmark]: Boogie Preprocessor took 30.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:57:00,697 INFO L168 Benchmark]: RCFGBuilder took 596.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:00,698 INFO L168 Benchmark]: BuchiAutomizer took 4683.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 810.3 MB in the end (delta: 257.7 MB). Peak memory consumption was 257.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:00,699 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.1 GB. Free memory is still 810.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:57:00,704 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 596.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4683.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 810.3 MB in the end (delta: 257.7 MB). Peak memory consumption was 257.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.1 GB. Free memory is still 810.3 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if -2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if -2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then -2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf99 lsp94 ukn79 mio100 lsp66 div100 bol100 ite100 ukn100 eq169 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 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...