./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer --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 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:49,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:49,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:49,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:49,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:49,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:49,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:49,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:49,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:49,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:49,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:49,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:49,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:49,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:49,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:49,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:49,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:49,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:49,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:49,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:49,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:49,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:49,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:49,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:49,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:49,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:49,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:49,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:49,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:49,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:49,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:49,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:49,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:49,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:49,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:49,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:49,639 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:49,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:49,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:49,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:49,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:49,648 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:49,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:49,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:49,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:49,650 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:49,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:49,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:49,651 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:49,651 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:49,652 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer 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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2018-11-18 08:34:49,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:49,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:49,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:49,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:49,686 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:49,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-18 08:34:49,724 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/data/0ab7b520e/1817f830c08943de9cb754097ab6067a/FLAG85bb38cfc [2018-11-18 08:34:50,163 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:50,164 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-18 08:34:50,171 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/data/0ab7b520e/1817f830c08943de9cb754097ab6067a/FLAG85bb38cfc [2018-11-18 08:34:50,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/data/0ab7b520e/1817f830c08943de9cb754097ab6067a [2018-11-18 08:34:50,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:50,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:50,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:50,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:50,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:50,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1e2329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50, skipping insertion in model container [2018-11-18 08:34:50,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:50,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:50,408 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:50,414 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:50,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:50,541 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:50,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50 WrapperNode [2018-11-18 08:34:50,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:50,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:50,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:50,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:50,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:50,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:50,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:50,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:50,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 08:34:50,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:50,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:50,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:50,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:50,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/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 [2018-11-18 08:34:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:50,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:50,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:50,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:50 BoogieIcfgContainer [2018-11-18 08:34:50,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:50,778 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:50,778 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:50,781 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:50,782 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:50,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:50" (1/3) ... [2018-11-18 08:34:50,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db68ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:50, skipping insertion in model container [2018-11-18 08:34:50,783 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:50,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (2/3) ... [2018-11-18 08:34:50,784 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db68ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:50, skipping insertion in model container [2018-11-18 08:34:50,784 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:50,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:50" (3/3) ... [2018-11-18 08:34:50,785 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2018-11-18 08:34:50,831 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:50,832 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:50,832 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:50,832 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:50,832 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:50,832 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:50,833 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:50,833 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:50,833 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:50,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:34:50,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 08:34:50,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:50,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:50,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:50,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:50,871 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:50,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 08:34:50,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 08:34:50,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:50,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:50,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:50,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:50,879 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 20#L367true assume !(main_~length~0 < 1); 4#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 15#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 21#L371-4true [2018-11-18 08:34:50,880 INFO L796 eck$LassoCheckResult]: Loop: 21#L371-4true assume true; 12#L371-1true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 19#L371-3true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 21#L371-4true [2018-11-18 08:34:50,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,885 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-18 08:34:50,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:50,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:50,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 47827, now seen corresponding path program 1 times [2018-11-18 08:34:50,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:50,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:50,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 176703755, now seen corresponding path program 1 times [2018-11-18 08:34:50,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,198 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:51,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:51,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:51,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:51,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:51,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:51,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:51,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 08:34:51,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:51,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:51,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,588 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:51,592 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:51,594 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 [2018-11-18 08:34:51,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,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 [2018-11-18 08:34:51,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:51,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,621 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 [2018-11-18 08:34:51,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,624 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 [2018-11-18 08:34:51,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:51,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:51,717 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 08:34:51,718 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:34:51,719 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:51,720 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:51,721 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:51,721 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-18 08:34:51,746 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 08:34:51,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:51,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:51,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:51,809 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 [2018-11-18 08:34:51,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-11-18 08:34:51,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 47 states and 60 transitions. Complement of second has 7 states. [2018-11-18 08:34:51,853 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 [2018-11-18 08:34:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 08:34:51,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 08:34:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 08:34:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 08:34:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:51,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2018-11-18 08:34:51,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:34:51,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 17 states and 21 transitions. [2018-11-18 08:34:51,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 08:34:51,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 08:34:51,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-18 08:34:51,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:51,864 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:34:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-18 08:34:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 08:34:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 08:34:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 08:34:51,882 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:34:51,882 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:34:51,882 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:51,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 08:34:51,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 08:34:51,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:51,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:51,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:51,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:51,884 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 143#L367 assume !(main_~length~0 < 1); 135#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 136#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 148#L371-4 assume true; 145#L371-1 assume !(main_~i~0 < main_~length~0); 133#L371-5 main_~j~0 := 0; 134#L374-4 [2018-11-18 08:34:51,884 INFO L796 eck$LassoCheckResult]: Loop: 134#L374-4 assume true; 141#L374-1 assume !!(main_~j~0 < main_~length~0); 139#L375-4 assume true; 137#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 138#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 140#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 134#L374-4 [2018-11-18 08:34:51,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash 176703697, now seen corresponding path program 1 times [2018-11-18 08:34:51,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1868654478, now seen corresponding path program 1 times [2018-11-18 08:34:51,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 799265886, now seen corresponding path program 1 times [2018-11-18 08:34:51,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,041 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:52,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:52,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:52,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:52,041 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:52,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:52,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:52,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 08:34:52,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:52,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:52,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:52,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:52,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,269 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 [2018-11-18 08:34:52,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,273 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 [2018-11-18 08:34:52,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,274 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 [2018-11-18 08:34:52,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:52,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,275 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 [2018-11-18 08:34:52,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,279 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 [2018-11-18 08:34:52,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,284 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 [2018-11-18 08:34:52,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,289 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 [2018-11-18 08:34:52,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,290 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:52,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,293 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,299 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 [2018-11-18 08:34:52,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,307 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 [2018-11-18 08:34:52,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:52,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:52,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:52,328 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:52,346 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 08:34:52,347 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:34:52,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:52,348 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:52,348 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:52,348 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 Supporting invariants [] [2018-11-18 08:34:52,381 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 08:34:52,386 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:52,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:52,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 08:34:52,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 08:34:52,484 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 27 states and 33 transitions. Complement of second has 7 states. [2018-11-18 08:34:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 08:34:52,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 08:34:52,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:52,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-18 08:34:52,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:52,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-18 08:34:52,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:52,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2018-11-18 08:34:52,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:52,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 32 transitions. [2018-11-18 08:34:52,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 08:34:52,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 08:34:52,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-18 08:34:52,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:52,489 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-18 08:34:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-18 08:34:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 08:34:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 08:34:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-18 08:34:52,493 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 08:34:52,493 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 08:34:52,493 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:52,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-18 08:34:52,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:52,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:52,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:52,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:52,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:52,494 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 275#L367 assume !(main_~length~0 < 1); 263#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 264#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 281#L371-4 assume true; 278#L371-1 assume !(main_~i~0 < main_~length~0); 261#L371-5 main_~j~0 := 0; 262#L374-4 assume true; 269#L374-1 assume !!(main_~j~0 < main_~length~0); 270#L375-4 [2018-11-18 08:34:52,495 INFO L796 eck$LassoCheckResult]: Loop: 270#L375-4 assume true; 265#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 266#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 270#L375-4 [2018-11-18 08:34:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1986437962, now seen corresponding path program 1 times [2018-11-18 08:34:52,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 71566, now seen corresponding path program 1 times [2018-11-18 08:34:52,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1913879879, now seen corresponding path program 1 times [2018-11-18 08:34:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:52,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:34:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:52,706 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-18 08:34:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:52,763 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-18 08:34:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:34:52,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-11-18 08:34:52,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:52,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 44 transitions. [2018-11-18 08:34:52,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 08:34:52,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 08:34:52,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-18 08:34:52,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:52,766 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 08:34:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-18 08:34:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-11-18 08:34:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 08:34:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-18 08:34:52,768 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 08:34:52,768 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 08:34:52,768 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:52,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-18 08:34:52,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:52,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:52,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:52,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:52,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:52,769 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 354#L367 assume !(main_~length~0 < 1); 341#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 342#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 361#L371-4 assume true; 358#L371-1 assume !(main_~i~0 < main_~length~0); 339#L371-5 main_~j~0 := 0; 340#L374-4 assume true; 357#L374-1 assume !!(main_~j~0 < main_~length~0); 364#L375-4 assume true; 363#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 351#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 352#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 355#L374-4 assume true; 347#L374-1 assume !!(main_~j~0 < main_~length~0); 348#L375-4 [2018-11-18 08:34:52,769 INFO L796 eck$LassoCheckResult]: Loop: 348#L375-4 assume true; 343#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 344#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 348#L375-4 [2018-11-18 08:34:52,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -704628477, now seen corresponding path program 2 times [2018-11-18 08:34:52,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:52,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:52,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c7f8c9a-f661-46f3-a364-cc8de4da88a6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:52,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:52,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:52,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:52,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:52,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 08:34:52,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-11-18 08:34:52,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:52,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 71566, now seen corresponding path program 2 times [2018-11-18 08:34:52,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:34:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:34:52,994 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-11-18 08:34:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:53,099 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 08:34:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:34:53,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-11-18 08:34:53,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:53,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 31 transitions. [2018-11-18 08:34:53,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 08:34:53,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 08:34:53,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-18 08:34:53,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:53,101 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 08:34:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-18 08:34:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-18 08:34:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 08:34:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 08:34:53,103 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 08:34:53,103 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 08:34:53,103 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:53,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 29 transitions. [2018-11-18 08:34:53,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:53,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:53,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:53,105 INFO L794 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 493#L367 assume !(main_~length~0 < 1); 480#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 481#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 500#L371-4 assume true; 497#L371-1 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 498#L371-3 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 501#L371-4 assume true; 496#L371-1 assume !(main_~i~0 < main_~length~0); 478#L371-5 main_~j~0 := 0; 479#L374-4 assume true; 499#L374-1 assume !!(main_~j~0 < main_~length~0); 503#L375-4 assume true; 502#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 490#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 491#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 494#L374-4 assume true; 486#L374-1 assume !!(main_~j~0 < main_~length~0); 487#L375-4 [2018-11-18 08:34:53,105 INFO L796 eck$LassoCheckResult]: Loop: 487#L375-4 assume true; 482#L375-1 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 483#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 487#L375-4 [2018-11-18 08:34:53,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1669263233, now seen corresponding path program 1 times [2018-11-18 08:34:53,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:53,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 71566, now seen corresponding path program 3 times [2018-11-18 08:34:53,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1889662990, now seen corresponding path program 1 times [2018-11-18 08:34:53,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,267 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:53,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:53,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:53,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:53,267 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:53,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:53,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:53,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:53,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 08:34:53,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:53,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:53,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,428 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:53,428 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:53,429 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 [2018-11-18 08:34:53,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,431 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 [2018-11-18 08:34:53,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,432 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 [2018-11-18 08:34:53,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,435 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 [2018-11-18 08:34:53,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,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 [2018-11-18 08:34:53,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,437 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 [2018-11-18 08:34:53,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,439 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 [2018-11-18 08:34:53,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,440 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 [2018-11-18 08:34:53,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,441 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 [2018-11-18 08:34:53,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,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 [2018-11-18 08:34:53,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,443 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:53,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:53,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,447 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 [2018-11-18 08:34:53,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,454 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 [2018-11-18 08:34:53,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,459 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 [2018-11-18 08:34:53,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,462 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 [2018-11-18 08:34:53,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,463 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:53,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:53,464 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:34:53,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:53,465 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 08:34:53,465 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:53,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-11-18 08:34:53,476 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 08:34:53,477 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:53,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:53,523 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 [2018-11-18 08:34:53,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 08:34:53,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 30 states and 33 transitions. Complement of second has 7 states. [2018-11-18 08:34:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 08:34:53,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 08:34:53,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,537 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:53,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:53,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:34:53,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 08:34:53,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 30 states and 33 transitions. Complement of second has 7 states. [2018-11-18 08:34:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 08:34:53,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 08:34:53,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,582 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:34:53,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:53,609 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:34:53,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 08:34:53,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 29 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 34 states and 39 transitions. Complement of second has 6 states. [2018-11-18 08:34:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 08:34:53,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-18 08:34:53,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 08:34:53,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-18 08:34:53,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-18 08:34:53,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:53,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:53,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:53,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:53,625 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:53,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:53,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:53,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:53,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:53 BoogieIcfgContainer [2018-11-18 08:34:53,630 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:53,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:53,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:53,631 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:53,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:50" (3/4) ... [2018-11-18 08:34:53,634 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:53,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:53,634 INFO L168 Benchmark]: Toolchain (without parser) took 3452.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -58.1 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:53,636 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:53,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -195.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:53,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:53,637 INFO L168 Benchmark]: Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:53,637 INFO L168 Benchmark]: RCFGBuilder took 189.94 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:53,637 INFO L168 Benchmark]: BuchiAutomizer took 2851.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:53,638 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:53,640 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -195.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.94 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2851.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 98 SDtfs, 171 SDslu, 111 SDs, 0 SdLazy, 151 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf99 lsp95 ukn78 mio100 lsp61 div100 bol100 ite100 ukn100 eq166 hnf87 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...