./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:22:44,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:22:44,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:22:44,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:22:44,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:22:44,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:22:44,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:22:44,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:22:44,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:22:44,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:22:44,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:22:44,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:22:44,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:22:44,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:22:44,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:22:44,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:22:44,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:22:44,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:22:44,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:22:45,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:22:45,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:22:45,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:22:45,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:22:45,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:22:45,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:22:45,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:22:45,010 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:22:45,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:22:45,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:22:45,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:22:45,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:22:45,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:22:45,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:22:45,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:22:45,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:22:45,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:22:45,020 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:22:45,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:22:45,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:22:45,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:22:45,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:22:45,046 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:22:45,046 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:22:45,046 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:22:45,046 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:22:45,046 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:22:45,047 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:22:45,047 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:22:45,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:22:45,047 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:22:45,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:22:45,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:22:45,048 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:22:45,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:22:45,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:22:45,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:22:45,049 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:22:45,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:22:45,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:22:45,050 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:22:45,050 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:22:45,051 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2018-11-28 23:22:45,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:22:45,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:22:45,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:22:45,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:22:45,118 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:22:45,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2018-11-28 23:22:45,196 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5ea737d/a3376a30d1384bd7ac1383e016740f72/FLAG7cc6e6ea2 [2018-11-28 23:22:45,698 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:22:45,698 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/count_up_alloca_true-termination.c.i [2018-11-28 23:22:45,709 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5ea737d/a3376a30d1384bd7ac1383e016740f72/FLAG7cc6e6ea2 [2018-11-28 23:22:45,998 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5ea737d/a3376a30d1384bd7ac1383e016740f72 [2018-11-28 23:22:46,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:22:46,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:22:46,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:22:46,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:22:46,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:22:46,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:45" (1/1) ... [2018-11-28 23:22:46,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c798e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46, skipping insertion in model container [2018-11-28 23:22:46,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:45" (1/1) ... [2018-11-28 23:22:46,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:22:46,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:22:46,508 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:22:46,524 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:22:46,603 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:22:46,672 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:22:46,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46 WrapperNode [2018-11-28 23:22:46,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:22:46,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:22:46,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:22:46,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:22:46,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:22:46,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:22:46,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:22:46,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:22:46,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... [2018-11-28 23:22:46,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:22:46,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:22:46,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:22:46,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:22:46,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:22:46,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:22:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:22:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:22:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:22:46,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:22:47,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:22:47,302 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:22:47,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:47 BoogieIcfgContainer [2018-11-28 23:22:47,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:22:47,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:22:47,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:22:47,308 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:22:47,309 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:47,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:22:45" (1/3) ... [2018-11-28 23:22:47,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a8821b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:22:47, skipping insertion in model container [2018-11-28 23:22:47,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:47,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:46" (2/3) ... [2018-11-28 23:22:47,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a8821b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:22:47, skipping insertion in model container [2018-11-28 23:22:47,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:47,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:47" (3/3) ... [2018-11-28 23:22:47,314 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_alloca_true-termination.c.i [2018-11-28 23:22:47,371 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:22:47,371 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:22:47,372 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:22:47,372 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:22:47,372 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:22:47,372 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:22:47,372 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:22:47,373 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:22:47,373 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:22:47,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:22:47,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:22:47,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:47,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:47,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:22:47,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:22:47,419 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:22:47,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:22:47,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:22:47,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:47,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:47,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:22:47,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:22:47,432 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2018-11-28 23:22:47,432 INFO L796 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2018-11-28 23:22:47,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 23:22:47,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:47,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:47,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:47,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2018-11-28 23:22:47,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:47,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2018-11-28 23:22:47,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:47,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:47,770 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:22:48,177 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-11-28 23:22:48,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:48,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:48,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:48,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:48,224 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:48,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:48,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:48,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:48,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:22:48,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:48,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:48,256 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-28 23:22:48,270 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-28 23:22:48,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-28 23:22:48,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-28 23:22:48,289 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-28 23:22:48,297 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-28 23:22:48,305 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-28 23:22:48,314 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-28 23:22:48,317 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-28 23:22:48,322 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-28 23:22:48,331 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-28 23:22:48,334 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-28 23:22:48,580 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 23:22:48,921 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:22:49,075 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:22:49,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:49,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:49,465 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-28 23:22:49,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,478 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-28 23:22:49,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,483 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-28 23:22:49,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,489 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-28 23:22:49,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:49,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:49,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:49,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:49,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,511 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-28 23:22:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,516 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-28 23:22:49,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,523 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-28 23:22:49,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,529 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-28 23:22:49,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:49,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:49,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:49,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,535 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-28 23:22:49,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:49,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:49,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:49,546 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-28 23:22:49,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:49,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:49,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:49,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:49,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:49,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:49,640 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:49,695 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:22:49,696 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:22:49,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:49,701 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:49,702 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:49,703 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-28 23:22:49,797 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:22:50,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:50,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:50,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:50,219 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-28 23:22:50,234 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-28 23:22:50,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-28 23:22:50,320 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2018-11-28 23:22:50,323 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-28 23:22:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-28 23:22:50,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:22:50,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:50,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:22:50,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:50,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:22:50,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:50,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2018-11-28 23:22:50,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:22:50,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-28 23:22:50,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:22:50,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:22:50,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 23:22:50,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:50,345 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:22:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 23:22:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:22:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:22:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 23:22:50,378 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:22:50,378 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:22:50,378 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:22:50,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 23:22:50,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:22:50,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:50,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:50,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:50,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:22:50,381 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2018-11-28 23:22:50,381 INFO L796 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2018-11-28 23:22:50,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2018-11-28 23:22:50,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:50,463 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-28 23:22:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:22:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:22:50,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:22:50,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2018-11-28 23:22:50,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:22:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:22:50,582 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 23:22:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:50,637 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 23:22:50,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:22:50,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 23:22:50,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:22:50,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2018-11-28 23:22:50,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:22:50,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:22:50,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-28 23:22:50,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:50,643 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-28 23:22:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-28 23:22:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-28 23:22:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:22:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 23:22:50,645 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:22:50,645 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 23:22:50,645 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:22:50,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 23:22:50,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:22:50,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:50,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:50,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:50,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:22:50,648 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2018-11-28 23:22:50,648 INFO L796 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2018-11-28 23:22:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2018-11-28 23:22:50,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2018-11-28 23:22:50,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2018-11-28 23:22:50,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:50,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:51,167 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-11-28 23:22:51,252 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:51,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:51,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:51,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:51,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:51,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:51,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:51,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:51,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:22:51,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:51,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:51,259 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-28 23:22:51,285 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-28 23:22:51,306 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-28 23:22:51,314 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-28 23:22:51,317 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-28 23:22:51,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-28 23:22: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-28 23:22:51,354 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-28 23:22: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-28 23:22:51,380 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-28 23:22:51,533 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 23:22:51,599 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-28 23:22:51,609 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-28 23:22:51,616 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-28 23:22:51,932 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:51,933 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:51,933 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-28 23:22:51,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,940 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-28 23:22:51,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,945 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-28 23:22:51,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,948 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-28 23:22:51,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,957 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-28 23:22:51,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,965 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-28 23:22:51,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:51,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:51,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,975 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-28 23:22:51,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,983 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-28 23:22:51,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:51,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:51,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,994 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-28 23:22:51,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:51,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:51,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:51,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:51,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:51,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:51,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:51,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:51,999 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-28 23:22:52,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:52,004 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:52,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:52,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:52,006 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:52,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:52,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:52,029 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-28 23:22:52,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:52,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:52,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:52,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:52,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:52,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:52,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:52,047 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-28 23:22:52,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:52,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:52,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:52,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:52,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:52,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:52,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:52,074 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-28 23:22:52,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:52,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:52,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:52,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:52,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:52,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:52,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:52,085 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-28 23:22:52,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:52,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:52,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:52,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:52,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:52,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:52,151 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:52,183 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:22:52,183 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:22:52,184 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:52,185 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:52,186 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:52,186 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:22:52,249 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:22:52,253 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:22:52,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:52,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:52,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:52,329 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-28 23:22:52,330 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-28 23:22:52,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 23:22:52,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2018-11-28 23:22:52,458 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-28 23:22:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:22:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 23:22:52,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:22:52,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:52,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:22:52,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:52,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-28 23:22:52,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:52,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-11-28 23:22:52,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:52,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2018-11-28 23:22:52,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:22:52,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:22:52,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-28 23:22:52,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:52,466 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 23:22:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-28 23:22:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-28 23:22:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:22:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-28 23:22:52,468 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 23:22:52,469 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 23:22:52,469 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:22:52,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-28 23:22:52,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:52,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:52,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:52,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:52,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:22:52,471 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2018-11-28 23:22:52,471 INFO L796 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 283#L380-3 [2018-11-28 23:22:52,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2018-11-28 23:22:52,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:52,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:52,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:52,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2018-11-28 23:22:52,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2018-11-28 23:22:52,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:52,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:52,770 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-28 23:22:52,820 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:52,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:52,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:52,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:52,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:52,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:52,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:52,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:52,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:22:52,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:52,821 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:52,826 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-28 23:22:52,829 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-28 23:22:52,831 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-28 23:22:52,833 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-28 23:22:52,836 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-28 23:22:52,992 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-28 23:22:52,994 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-28 23:22:53,015 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-28 23:22:53,018 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-28 23:22:53,020 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-28 23:22:53,022 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-28 23:22:53,025 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-28 23:22:53,444 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 23:22:53,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:53,514 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:53,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:53,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:53,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:53,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:53,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:53,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:53,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:53,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:53,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:53,517 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-28 23:22:53,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:53,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:53,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:53,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:53,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:53,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:53,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:53,521 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-28 23:22:53,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:53,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:53,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:53,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:53,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:53,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:53,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:53,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:53,523 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-28 23:22:53,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:53,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:53,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:53,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:53,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:53,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:53,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:53,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:53,526 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-28 23:22:53,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:53,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:53,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:53,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:53,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:53,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:53,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:53,568 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:22:53,570 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:22:53,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:53,571 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:53,571 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:53,571 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*ULTIMATE.start_main_~limit~0 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2018-11-28 23:22:53,678 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:22:53,709 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:53,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:53,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:53,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:53,963 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-28 23:22:53,964 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-28 23:22:53,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:22:54,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2018-11-28 23:22:54,017 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-28 23:22:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:22:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-28 23:22:54,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:22:54,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:54,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 23:22:54,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:54,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-28 23:22:54,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:54,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-28 23:22:54,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:54,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2018-11-28 23:22:54,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:22:54,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:22:54,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-28 23:22:54,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:54,022 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-28 23:22:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-28 23:22:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:22:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:22:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-28 23:22:54,025 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 23:22:54,025 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 23:22:54,025 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:22:54,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-28 23:22:54,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:54,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:54,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:54,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:54,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:22:54,027 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 427#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 428#L369 assume !(main_~length~0 < 1); 435#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 431#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 432#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 425#L374 assume !(main_~val~0 > main_~limit~0); 426#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 429#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 433#L372-3 assume !(main_~i~0 < main_~length~0); 434#L372-4 main_~j~0 := 0; 423#L379-3 assume !!(main_~j~0 < main_~length~0); 424#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 436#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 417#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 418#L379-3 assume !!(main_~j~0 < main_~length~0); 419#L380-3 [2018-11-28 23:22:54,027 INFO L796 eck$LassoCheckResult]: Loop: 419#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 420#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 419#L380-3 [2018-11-28 23:22:54,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2018-11-28 23:22:54,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:54,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:54,212 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-28 23:22:54,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:22:54,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:22:54,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:22:54,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:22:54,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:22:54,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:54,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:22:54,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2018-11-28 23:22:54,411 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:22:54,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2018-11-28 23:22:54,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:54,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:22:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:22:54,509 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-28 23:22:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:54,874 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-28 23:22:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 23:22:54,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2018-11-28 23:22:54,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:54,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2018-11-28 23:22:54,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:22:54,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:22:54,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-28 23:22:54,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:54,879 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 23:22:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-28 23:22:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-28 23:22:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:22:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-28 23:22:54,883 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 23:22:54,883 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-28 23:22:54,883 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:22:54,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-28 23:22:54,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:22:54,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:54,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:54,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:54,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:22:54,885 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 571#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 572#L369 assume !(main_~length~0 < 1); 579#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 574#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 575#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 578#L374 assume !(main_~val~0 > main_~limit~0); 583#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 576#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 577#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 568#L374 assume !(main_~val~0 > main_~limit~0); 569#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 570#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 582#L372-3 assume !(main_~i~0 < main_~length~0); 581#L372-4 main_~j~0 := 0; 566#L379-3 assume !!(main_~j~0 < main_~length~0); 567#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 584#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 564#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 565#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 [2018-11-28 23:22:54,885 INFO L796 eck$LassoCheckResult]: Loop: 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 561#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 560#L380-3 [2018-11-28 23:22:54,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2018-11-28 23:22:54,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:54,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2018-11-28 23:22:54,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:54,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2018-11-28 23:22:54,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:55,131 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:22:55,457 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 86 [2018-11-28 23:22:55,574 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 23:22:55,581 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:55,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:55,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:55,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:55,582 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:55,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:55,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:55,582 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:55,582 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:22:55,582 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:55,583 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:55,586 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-28 23:22:55,705 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-28 23:22:55,729 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-28 23:22:55,732 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-28 23:22:55,734 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-28 23:22:55,736 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-28 23:22:55,737 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-28 23:22:55,739 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-28 23:22:55,740 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-28 23:22:55,744 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-28 23:22:55,746 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-28 23:22:55,747 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-28 23:22:55,748 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-28 23:22:56,010 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:56,010 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:56,011 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-28 23:22:56,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:56,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:56,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:56,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:56,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:56,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:56,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:56,026 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-28 23:22:56,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:56,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:56,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:56,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:56,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:56,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:56,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:56,039 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-28 23:22:56,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:56,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:56,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:56,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:56,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:56,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:56,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:56,058 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-28 23:22:56,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:56,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:56,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:56,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:56,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:56,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:56,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:56,071 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-28 23:22:56,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:56,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:56,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:56,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:56,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:56,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:56,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:56,092 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:22:56,094 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:22:56,094 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:56,095 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:56,095 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:56,095 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))_3, ULTIMATE.start_main_~limit~0) = -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))_3 + 1*ULTIMATE.start_main_~limit~0 Supporting invariants [] [2018-11-28 23:22:56,131 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:22:56,133 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:56,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,203 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-28 23:22:56,204 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-28 23:22:56,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:22:56,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:22:56,287 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-28 23:22:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:22:56,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 23:22:56,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:56,288 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:56,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,341 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-28 23:22:56,342 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-28 23:22:56,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:22:56,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:22:56,366 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-28 23:22:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:22:56,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 23:22:56,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:56,367 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:56,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:56,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:56,457 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-28 23:22:56,457 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-28 23:22:56,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:22:56,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2018-11-28 23:22:56,499 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-28 23:22:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 23:22:56,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2018-11-28 23:22:56,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:56,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2018-11-28 23:22:56,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:56,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-28 23:22:56,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:56,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-28 23:22:56,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:56,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-28 23:22:56,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:22:56,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:22:56,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:22:56,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:56,504 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:56,504 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:56,504 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:56,505 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:22:56,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:22:56,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:56,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:22:56,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:56 BoogieIcfgContainer [2018-11-28 23:22:56,513 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:56,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:56,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:56,513 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:56,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:47" (3/4) ... [2018-11-28 23:22:56,517 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:22:56,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:56,518 INFO L168 Benchmark]: Toolchain (without parser) took 10516.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 951.3 MB in the beginning and 823.8 MB in the end (delta: 127.5 MB). Peak memory consumption was 322.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:56,519 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:56,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:56,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:56,523 INFO L168 Benchmark]: Boogie Preprocessor took 26.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:56,524 INFO L168 Benchmark]: RCFGBuilder took 473.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:56,526 INFO L168 Benchmark]: BuchiAutomizer took 9209.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 823.8 MB in the end (delta: 255.7 MB). Peak memory consumption was 339.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:56,527 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 823.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:56,533 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 669.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 473.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9209.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 823.8 MB in the end (delta: 255.7 MB). Peak memory consumption was 339.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 823.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 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 unknown-#length-unknown[arr] + -1 * arr + -4 * j and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[arr][4 * j + arr] + limit and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 223 SDslu, 87 SDs, 0 SdLazy, 189 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital125 mio100 ax100 hnf98 lsp94 ukn79 mio100 lsp56 div100 bol100 ite100 ukn100 eq165 hnf89 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms 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...