./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 0ed9222f 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-0ed9222-m [2019-01-14 02:39:44,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:39:44,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:39:44,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:39:44,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:39:44,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:39:44,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:39:44,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:39:44,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:39:44,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:39:44,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:39:44,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:39:44,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:39:44,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:39:44,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:39:44,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:39:44,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:39:44,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:39:44,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:39:44,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:39:44,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:39:44,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:39:44,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:39:44,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:39:44,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:39:44,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:39:44,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:39:44,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:39:44,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:39:44,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:39:44,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:39:44,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:39:44,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:39:44,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:39:44,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:39:44,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:39:44,385 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:39:44,405 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:39:44,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:39:44,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:39:44,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:39:44,407 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:39:44,407 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:39:44,407 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:39:44,407 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:39:44,407 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:39:44,408 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:39:44,408 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:39:44,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:39:44,408 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:39:44,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:39:44,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:39:44,409 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:39:44,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:39:44,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:39:44,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:39:44,410 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:39:44,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:39:44,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:39:44,411 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:39:44,412 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:39:44,412 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-14 02:39:44,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:39:44,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:39:44,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:39:44,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:39:44,482 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:39:44,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i [2019-01-14 02:39:44,546 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980816ad2/2824305b0d4e4c30b7532c8248a76960/FLAGfacf94c8a [2019-01-14 02:39:45,070 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:39:45,071 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array06_alloca_true-termination.c.i [2019-01-14 02:39:45,081 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980816ad2/2824305b0d4e4c30b7532c8248a76960/FLAGfacf94c8a [2019-01-14 02:39:45,377 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980816ad2/2824305b0d4e4c30b7532c8248a76960 [2019-01-14 02:39:45,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:39:45,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:39:45,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:39:45,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:39:45,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:39:45,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:39:45" (1/1) ... [2019-01-14 02:39:45,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20575267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:45, skipping insertion in model container [2019-01-14 02:39:45,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:39:45" (1/1) ... [2019-01-14 02:39:45,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:39:45,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:39:45,763 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:39:45,781 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:39:45,865 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:39:46,024 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:39:46,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46 WrapperNode [2019-01-14 02:39:46,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:39:46,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:39:46,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:39:46,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:39:46,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:39:46,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:39:46,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:39:46,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:39:46,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (1/1) ... [2019-01-14 02:39:46,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:39:46,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:39:46,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:39:46,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:39:46,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (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-14 02:39:46,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:39:46,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:39:46,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:39:46,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:39:46,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:39:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:39:46,494 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:39:46,494 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:39:46,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:46 BoogieIcfgContainer [2019-01-14 02:39:46,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:39:46,497 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:39:46,497 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:39:46,500 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:39:46,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:46,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:39:45" (1/3) ... [2019-01-14 02:39:46,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1423a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:39:46, skipping insertion in model container [2019-01-14 02:39:46,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:46,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:39:46" (2/3) ... [2019-01-14 02:39:46,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1423a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:39:46, skipping insertion in model container [2019-01-14 02:39:46,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:39:46,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:46" (3/3) ... [2019-01-14 02:39:46,509 INFO L375 chiAutomizerObserver]: Analyzing ICFG array06_alloca_true-termination.c.i [2019-01-14 02:39:46,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:39:46,570 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:39:46,570 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:39:46,570 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:39:46,570 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:39:46,571 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:39:46,571 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:39:46,571 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:39:46,571 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:39:46,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:39:46,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-14 02:39:46,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:46,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:46,614 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:39:46,614 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:39:46,614 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:39:46,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 02:39:46,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-14 02:39:46,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:46,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:46,617 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:39:46,617 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:39:46,626 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-14 02:39:46,626 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-14 02:39:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:39:46,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:46,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-14 02:39:46,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:46,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:46,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-14 02:39:46,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:46,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:47,203 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-14 02:39:47,377 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:39:47,387 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:39:47,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:39:47,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:39:47,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:39:47,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:39:47,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:39:47,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:39:47,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:39:47,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:39:47,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:39:47,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:39:47,415 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-14 02:39:47,446 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-14 02:39:47,464 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-14 02:39:47,472 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-14 02:39:47,477 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-14 02:39:47,682 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:39:47,735 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-14 02:39:47,739 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-14 02:39:47,745 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-14 02:39:47,748 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-14 02:39:48,051 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 02:39:48,205 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:39:48,439 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:39:48,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:39:48,477 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:39:48,480 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-14 02:39:48,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:48,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:48,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:48,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:48,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:48,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:48,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:48,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:48,490 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-14 02:39:48,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:48,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:48,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:48,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:48,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:48,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:48,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:48,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:48,494 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-14 02:39:48,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:48,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:48,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:48,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:48,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:48,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:48,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:48,505 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-14 02:39:48,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:48,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:48,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:48,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:48,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:48,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:48,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:48,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:48,510 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-14 02:39:48,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:48,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:48,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:48,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:48,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:48,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:48,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:39:48,634 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:39:48,634 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:39:48,637 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:39:48,640 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:39:48,640 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:39:48,646 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2019-01-14 02:39:48,663 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:39:48,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:39:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:48,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:48,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:48,779 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-14 02:39:48,792 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-14 02:39:48,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-14 02:39:48,853 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-14 02:39:48,854 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-14 02:39:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:39:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 02:39:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:39:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:39:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:48,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:39:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:48,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 02:39:48,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:48,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-01-14 02:39:48,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:39:48,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:39:48,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:39:48,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:48,871 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:39:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:39:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:39:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:39:48,893 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:48,894 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:39:48,894 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:39:48,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:39:48,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:48,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:48,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:48,895 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:39:48,896 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:39:48,896 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-14 02:39:48,896 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~post210;havoc main_#t~mem209; 103#L374-2 [2019-01-14 02:39:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-14 02:39:48,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:48,970 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-14 02:39:48,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:39:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:39:48,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:39:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-01-14 02:39:48,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:39:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:39:49,057 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:39:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:39:49,256 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-14 02:39:49,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:39:49,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:39:49,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:49,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-14 02:39:49,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:39:49,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:39:49,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-14 02:39:49,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:49,260 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:39:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-14 02:39:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:39:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:39:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-14 02:39:49,262 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:39:49,262 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:39:49,262 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:39:49,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-14 02:39:49,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:39:49,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:39:49,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:39:49,264 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:39:49,264 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:39:49,264 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-14 02:39:49,264 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~post210;havoc main_#t~mem209; 131#L374-2 [2019-01-14 02:39:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-01-14 02:39:49,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-01-14 02:39:49,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:49,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:39:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-01-14 02:39:49,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:39:49,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:39:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:39:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:39:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:39:49,790 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-14 02:39:49,850 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:39:49,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:39:49,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:39:49,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:39:49,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:39:49,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:39:49,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:39:49,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:39:49,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:39:49,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:39:49,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:39:49,858 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-14 02:39:49,863 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-14 02:39:49,866 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-14 02:39:49,870 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-14 02:39:49,872 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-14 02:39:50,079 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-14 02:39:50,081 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-14 02:39:50,084 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-14 02:39:50,088 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-14 02:39:50,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:39:50,398 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:39:50,399 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-14 02:39:50,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,405 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-14 02:39:50,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,411 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-14 02:39:50,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:50,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,420 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-14 02:39:50,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,430 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-14 02:39:50,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:50,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,443 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-14 02:39:50,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:50,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,514 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-14 02:39:50,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:39:50,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,519 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:39:50,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,537 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-14 02:39:50,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:50,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,560 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-14 02:39:50,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,566 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-14 02:39:50,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,569 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-14 02:39:50,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:39:50,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:39:50,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,581 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-14 02:39:50,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:39:50,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:39:50,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,586 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:39:50,586 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-14 02:39:50,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,588 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:50,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,589 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-14 02:39:50,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,597 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:50,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,601 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-14 02:39:50,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,605 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:50,605 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:50,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,609 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-14 02:39:50,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:39:50,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:39:50,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:39:50,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,612 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-14 02:39:50,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:50,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:50,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:39:50,625 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-14 02:39:50,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:39:50,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:39:50,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:39:50,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:39:50,632 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 02:39:50,634 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-14 02:39:50,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:39:50,777 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:39:50,780 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:39:50,780 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:39:50,782 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-01-14 02:39:50,783 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:39:50,783 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-14 02:39:50,865 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:39:50,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:50,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:50,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:39:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:39:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:50,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:39:50,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:39:50,940 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-14 02:39:50,940 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-14 02:39:50,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:39:50,970 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-14 02:39:50,971 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-14 02:39:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:39:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-01-14 02:39:50,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-14 02:39:50,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:50,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 02:39:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:50,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:39:50,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:39:50,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:39:50,974 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:39:50,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-14 02:39:50,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:39:50,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:39:50,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:39:50,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:39:50,975 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:50,975 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:50,975 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:39:50,975 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:39:50,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:39:50,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:39:50,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:39:50,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:39:50 BoogieIcfgContainer [2019-01-14 02:39:50,983 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:39:50,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:39:50,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:39:50,984 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:39:50,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:39:46" (3/4) ... [2019-01-14 02:39:50,988 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:39:50,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:39:50,989 INFO L168 Benchmark]: Toolchain (without parser) took 5608.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 947.3 MB in the beginning and 840.0 MB in the end (delta: 107.3 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:50,991 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:39:50,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:50,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.51 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:50,993 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 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-01-14 02:39:50,994 INFO L168 Benchmark]: RCFGBuilder took 388.54 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:50,995 INFO L168 Benchmark]: BuchiAutomizer took 4486.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.0 MB in the end (delta: 267.4 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:39:50,995 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 840.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:39:51,000 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.51 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.00 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 388.54 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4486.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.0 MB in the end (delta: 267.4 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 ms. Allocated memory is still 1.2 GB. Free memory is still 840.0 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 unknown-#length-unknown[arr] + -4 * i + -1 * 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.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. 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.2s 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...