./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array14_alloca_false-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/array14_alloca_false-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 519b4f74907cdda12f126cdccb2c6422dda5240e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:23:50,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:50,335 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:50,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:50,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:50,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:50,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:50,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:50,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:50,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:50,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:50,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:50,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:50,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:50,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:50,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:50,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:50,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:50,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:50,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:50,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:50,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:50,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:50,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:50,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:50,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:50,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:50,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:50,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:50,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:50,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:50,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:50,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:50,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:50,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:50,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:50,388 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:23:50,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:50,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:50,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:50,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:50,408 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:50,408 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:50,408 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:50,408 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:50,409 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:50,409 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:50,410 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:50,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:50,410 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:50,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:50,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:50,410 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:50,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:50,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:50,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:50,412 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:50,412 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:50,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:50,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:50,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:50,413 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:50,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:50,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:50,413 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:50,416 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:50,416 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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2018-11-28 23:23:50,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:50,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:50,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:50,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:50,475 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:50,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array14_alloca_false-termination.c.i [2018-11-28 23:23:50,535 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec3dc479/c225bc9d0df54923991f3c3864acbe9e/FLAG6696e76f4 [2018-11-28 23:23:51,070 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:51,071 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array14_alloca_false-termination.c.i [2018-11-28 23:23:51,082 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec3dc479/c225bc9d0df54923991f3c3864acbe9e/FLAG6696e76f4 [2018-11-28 23:23:51,320 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec3dc479/c225bc9d0df54923991f3c3864acbe9e [2018-11-28 23:23:51,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:51,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:51,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:51,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:51,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:51,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbc0696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51, skipping insertion in model container [2018-11-28 23:23:51,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:51,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:51,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:51,784 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:51,799 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:51,881 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:51,969 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:51,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51 WrapperNode [2018-11-28 23:23:51,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:51,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:51,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:51,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:52,056 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:23:51" (1/1) ... [2018-11-28 23:23:52,080 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:23:51" (1/1) ... [2018-11-28 23:23:52,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:52,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:52,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:52,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:52,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (1/1) ... [2018-11-28 23:23:52,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:52,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:52,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:52,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:52,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (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:23:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:52,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:52,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:52,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:52,589 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:23:52,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:52 BoogieIcfgContainer [2018-11-28 23:23:52,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:52,591 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:52,591 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:52,596 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:52,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:52,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:51" (1/3) ... [2018-11-28 23:23:52,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7285aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:52, skipping insertion in model container [2018-11-28 23:23:52,599 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:52,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:51" (2/3) ... [2018-11-28 23:23:52,599 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7285aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:52, skipping insertion in model container [2018-11-28 23:23:52,599 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:52,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:52" (3/3) ... [2018-11-28 23:23:52,603 INFO L375 chiAutomizerObserver]: Analyzing ICFG array14_alloca_false-termination.c.i [2018-11-28 23:23:52,672 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:52,673 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:52,673 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:52,673 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:52,674 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:52,674 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:52,674 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:52,674 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:52,674 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:52,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:23:52,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:52,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:52,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:52,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:52,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:52,725 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:52,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:23:52,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:52,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:52,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:52,728 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:52,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:52,737 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-11-28 23:23:52,738 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-11-28 23:23:52,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 23:23:52,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-28 23:23:52,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-28 23:23:52,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:52,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:52,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:53,106 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:23:53,518 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-28 23:23:53,564 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:53,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:53,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:53,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:53,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:53,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:53,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:53,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:53,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-28 23:23:53,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:53,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:53,591 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:23:53,601 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:23:53,610 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:23:53,615 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:23:53,621 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:23:53,630 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:23:53,637 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:23:53,639 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:23:53,642 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:23:53,847 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:23:53,869 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:23:53,874 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:23:54,228 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:23:54,448 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 23:23:54,687 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:23:54,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:54,738 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:54,740 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:23:54,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,748 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:23:54,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,752 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:23:54,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,756 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:23:54,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,759 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:23:54,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,769 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:23:54,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,773 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:23:54,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,777 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:23:54,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:54,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:54,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:54,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,781 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:23:54,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:54,963 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:23:54,963 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:23:54,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:54,969 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:54,970 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:54,970 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-28 23:23:55,041 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:23:55,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:55,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:55,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:55,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:55,237 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:23:55,255 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:23:55,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-28 23:23:55,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-11-28 23:23:55,339 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:23:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-28 23:23:55,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:23:55,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:55,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 23:23:55,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:55,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 23:23:55,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:55,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-11-28 23:23:55,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:55,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-11-28 23:23:55,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:23:55,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:23:55,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-28 23:23:55,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:55,357 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-28 23:23:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 23:23:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:23:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-28 23:23:55,384 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:55,384 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:55,384 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:55,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-28 23:23:55,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:55,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:55,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:55,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:55,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:55,386 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-11-28 23:23:55,386 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2018-11-28 23:23:55,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-28 23:23:55,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:55,487 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:23:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:23:55,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:55,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-11-28 23:23:55,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:23:55,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:23:55,590 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 23:23:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:55,665 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-28 23:23:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:23:55,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-28 23:23:55,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:55,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:23:55,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:23:55,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:23:55,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:23:55,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:55,671 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:23:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:23:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-28 23:23:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:23:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 23:23:55,674 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:23:55,674 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:23:55,674 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:55,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 23:23:55,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:55,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:55,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:55,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:55,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:55,678 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-11-28 23:23:55,678 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2018-11-28 23:23:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-28 23:23:55,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:55,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-11-28 23:23:55,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-11-28 23:23:55,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,973 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:23:56,120 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 23:23:56,436 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-11-28 23:23:56,512 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:56,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:56,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:56,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:56,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:56,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:56,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:56,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:56,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration3_Lasso [2018-11-28 23:23:56,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:56,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:56,519 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:23:56,531 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:23:56,708 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-28 23:23:56,743 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:23:56,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:23:56,749 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:23:56,753 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:23:56,756 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:23:56,759 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:23:56,761 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:23:56,764 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:23:56,766 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:23:56,770 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:23:57,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:57,074 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:57,075 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:23:57,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:57,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:57,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:57,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:57,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:57,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:57,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:57,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:57,078 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:23:57,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:57,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:57,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:57,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:57,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:57,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:57,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:57,083 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:23:57,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:57,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:57,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:57,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:57,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:57,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:57,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:57,135 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:23:57,135 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:23:57,135 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:57,136 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:57,137 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:57,137 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 + 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:23:57,189 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:23:57,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:57,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:57,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:57,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:57,498 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:23:57,499 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:23:57,499 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:23:57,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 23:23:57,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2018-11-28 23:23:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:23:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:23:57,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:23:57,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:57,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:23:57,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:57,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:23:57,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:57,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-28 23:23:57,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:57,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:23:57,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:23:57,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:57,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 23:23:57,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:57,656 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:23:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 23:23:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:23:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:23:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:23:57,661 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:23:57,661 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:23:57,661 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:23:57,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-28 23:23:57,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:57,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:57,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:57,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:57,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:57,667 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 251#L367 assume !(main_~length~0 < 1); 262#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 263#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 264#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 252#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 253#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 265#L370-3 assume !(main_~i~0 < main_~length~0); 254#L370-4 main_~j~0 := 0; 255#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 261#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 257#L378-2 [2018-11-28 23:23:57,667 INFO L796 eck$LassoCheckResult]: Loop: 257#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 258#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 257#L378-2 [2018-11-28 23:23:57,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-11-28 23:23:57,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-11-28 23:23:57,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:57,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-11-28 23:23:57,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:57,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:57,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:57,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:23:57,924 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:23:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:57,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:23:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 23:23:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:23:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:23:58,117 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-28 23:23:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:58,360 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-11-28 23:23:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:23:58,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2018-11-28 23:23:58,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:58,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2018-11-28 23:23:58,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:23:58,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:58,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2018-11-28 23:23:58,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:58,365 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:23:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2018-11-28 23:23:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-28 23:23:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:23:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-28 23:23:58,367 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 23:23:58,367 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-28 23:23:58,367 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:23:58,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-28 23:23:58,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:58,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:58,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:58,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:58,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:58,369 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 365#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 366#L367 assume !(main_~length~0 < 1); 377#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 378#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 379#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 382#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 380#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 381#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 367#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 368#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 383#L370-3 assume !(main_~i~0 < main_~length~0); 369#L370-4 main_~j~0 := 0; 370#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 376#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 372#L378-2 [2018-11-28 23:23:58,369 INFO L796 eck$LassoCheckResult]: Loop: 372#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 373#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 372#L378-2 [2018-11-28 23:23:58,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2018-11-28 23:23:58,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-11-28 23:23:58,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:58,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:58,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:58,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2018-11-28 23:23:58,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:58,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:58,976 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2018-11-28 23:23:59,027 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:59,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:59,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:59,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:59,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:59,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:59,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:59,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:59,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca_false-termination.c.i_Iteration5_Lasso [2018-11-28 23:23:59,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:59,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:59,031 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:23:59,037 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:23:59,039 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:23:59,041 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:23:59,043 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:23:59,055 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:23:59,057 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:23:59,251 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:23:59,254 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:23:59,257 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:23:59,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:23:59,513 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:59,513 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:59,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:23:59,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:59,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:59,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:59,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,520 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:23:59,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:59,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:59,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,527 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:23:59,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:59,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:59,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:59,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,532 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:23:59,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:59,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:59,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:59,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:59,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:59,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:59,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:59,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,542 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:23:59,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:59,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:59,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:59,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:59,548 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:23:59,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:59,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:59,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:59,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:59,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:59,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:59,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:59,583 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:23:59,583 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:23:59,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:59,584 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:59,586 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:59,586 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2018-11-28 23:23:59,674 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:23:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:59,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:59,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:59,959 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:23:59,959 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:23:59,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:23:59,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2018-11-28 23:23:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-28 23:23:59,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 23:23:59,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 23:23:59,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-28 23:23:59,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2018-11-28 23:23:59,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2018-11-28 23:23:59,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:23:59,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:23:59,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2018-11-28 23:23:59,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:59,991 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-28 23:23:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2018-11-28 23:23:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:23:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:23:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-11-28 23:23:59,994 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-28 23:23:59,994 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-28 23:23:59,994 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:23:59,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2018-11-28 23:23:59,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:59,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:59,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:59,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:59,996 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 495#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 496#L367 assume !(main_~length~0 < 1); 507#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 508#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 509#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 513#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 510#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 511#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 497#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 498#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 514#L370-3 assume !(main_~i~0 < main_~length~0); 499#L370-4 main_~j~0 := 0; 500#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 506#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 512#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 515#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 502#L378-2 [2018-11-28 23:23:59,996 INFO L796 eck$LassoCheckResult]: Loop: 502#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 503#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 502#L378-2 [2018-11-28 23:23:59,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2018-11-28 23:23:59,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-11-28 23:24:00,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2018-11-28 23:24:00,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:00,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:00,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:00,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:24:00,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:24:00,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:00,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:00,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:00,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-28 23:24:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:24:00,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:24:00,551 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-28 23:24:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:00,663 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-28 23:24:00,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:24:00,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2018-11-28 23:24:00,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:24:00,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2018-11-28 23:24:00,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:24:00,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:24:00,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2018-11-28 23:24:00,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:00,667 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-28 23:24:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2018-11-28 23:24:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-28 23:24:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:24:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-11-28 23:24:00,671 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-28 23:24:00,672 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-11-28 23:24:00,672 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:24:00,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2018-11-28 23:24:00,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:00,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:00,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:00,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:00,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:24:00,674 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 645#L367 assume !(main_~length~0 < 1); 656#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 657#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 658#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 664#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 667#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 665#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 666#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 659#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 660#L370-3 assume !(main_~i~0 < main_~length~0); 648#L370-4 main_~j~0 := 0; 649#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 668#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 662#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 663#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 679#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 677#L378-2 [2018-11-28 23:24:00,674 INFO L796 eck$LassoCheckResult]: Loop: 677#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 674#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 651#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 652#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 677#L378-2 [2018-11-28 23:24:00,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2018-11-28 23:24:00,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-11-28 23:24:00,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:00,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:00,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:00,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2018-11-28 23:24:00,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:01,312 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2018-11-28 23:24:01,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:01 BoogieIcfgContainer [2018-11-28 23:24:01,407 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:01,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:01,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:01,408 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:01,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:52" (3/4) ... [2018-11-28 23:24:01,414 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:24:01,481 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:24:01,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:01,483 INFO L168 Benchmark]: Toolchain (without parser) took 10158.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 954.0 MB in the beginning and 891.1 MB in the end (delta: 62.9 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:01,486 INFO L168 Benchmark]: CDTParser took 0.30 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:24:01,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.53 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 927.2 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:24:01,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:01,491 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:01,491 INFO L168 Benchmark]: RCFGBuilder took 442.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:01,493 INFO L168 Benchmark]: BuchiAutomizer took 8815.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 898.9 MB in the end (delta: 202.9 MB). Peak memory consumption was 279.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:01,495 INFO L168 Benchmark]: Witness Printer took 74.58 ms. Allocated memory is still 1.2 GB. Free memory was 898.9 MB in the beginning and 891.1 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:01,501 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.30 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 643.53 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 927.2 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 143.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 442.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8815.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 898.9 MB in the end (delta: 202.9 MB). Peak memory consumption was 279.4 MB. Max. memory is 11.5 GB. * Witness Printer took 74.58 ms. Allocated memory is still 1.2 GB. Free memory was 898.9 MB in the beginning and 891.1 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + 8 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 63 SDtfs, 115 SDslu, 74 SDs, 0 SdLazy, 155 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf98 lsp93 ukn82 mio100 lsp63 div100 bol100 ite100 ukn100 eq163 hnf88 smp95 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=5, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@622b1145=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fbce0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29b48dd7=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6cc3cf9d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29b48dd7=5, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7a5cbf9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1fdacd03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@218d1a82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@17e6fca3=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i