./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array15_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array15_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-6b5699a [2019-11-25 08:51:08,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:08,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:08,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:08,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:08,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:08,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:08,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:08,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:08,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:08,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:08,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:08,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:08,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:08,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:08,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:08,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:08,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:08,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:08,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:08,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:08,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:08,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:08,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:08,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:08,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:08,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:08,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:08,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:08,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:08,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:08,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:08,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:08,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:08,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:08,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:08,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:08,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:08,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:08,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:08,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:08,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:51:08,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:08,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:08,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:08,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:08,664 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:08,664 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:51:08,665 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:51:08,665 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:51:08,665 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:51:08,665 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:51:08,666 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:51:08,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:08,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:51:08,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:08,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:08,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:51:08,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:51:08,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:51:08,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:08,668 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:51:08,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:08,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:51:08,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:08,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:08,669 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:51:08,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:08,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:08,670 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:51:08,671 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:51:08,671 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2019-11-25 08:51:08,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:08,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:08,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:08,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:08,828 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:08,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/../../sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-25 08:51:08,881 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/data/92b10bb76/e9b42afa772e4b34906618b98a4fe37b/FLAG6385c25ca [2019-11-25 08:51:09,388 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:09,389 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-25 08:51:09,400 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/data/92b10bb76/e9b42afa772e4b34906618b98a4fe37b/FLAG6385c25ca [2019-11-25 08:51:09,897 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/data/92b10bb76/e9b42afa772e4b34906618b98a4fe37b [2019-11-25 08:51:09,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:09,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:09,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:09,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:09,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:09,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:09" (1/1) ... [2019-11-25 08:51:09,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5388ff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:09, skipping insertion in model container [2019-11-25 08:51:09,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:09" (1/1) ... [2019-11-25 08:51:09,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:09,949 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:10,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:10,289 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:51:10,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:10,390 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:51:10,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10 WrapperNode [2019-11-25 08:51:10,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:10,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:10,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:51:10,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:51:10,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:10,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:51:10,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:51:10,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:51:10,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... [2019-11-25 08:51:10,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:51:10,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:51:10,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:51:10,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:51:10,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:51:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:51:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:51:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:51:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:51:10,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:51:10,803 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:51:10,804 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-25 08:51:10,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:10 BoogieIcfgContainer [2019-11-25 08:51:10,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:51:10,806 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:51:10,806 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:51:10,808 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:51:10,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:10,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:51:09" (1/3) ... [2019-11-25 08:51:10,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@456e57c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:51:10, skipping insertion in model container [2019-11-25 08:51:10,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:10,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:10" (2/3) ... [2019-11-25 08:51:10,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@456e57c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:51:10, skipping insertion in model container [2019-11-25 08:51:10,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:51:10,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:10" (3/3) ... [2019-11-25 08:51:10,812 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2019-11-25 08:51:10,850 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:51:10,850 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:51:10,850 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:51:10,851 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:51:10,851 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:51:10,851 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:51:10,851 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:51:10,851 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:51:10,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:51:10,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:51:10,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:10,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:10,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:51:10,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:10,893 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:51:10,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:51:10,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:51:10,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:10,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:10,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:51:10,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:10,900 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-25 08:51:10,901 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 [2019-11-25 08:51:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-25 08:51:10,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:10,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021972676] [2019-11-25 08:51:10,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:11,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-25 08:51:11,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:11,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797365767] [2019-11-25 08:51:11,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:11,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:11,034 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-25 08:51:11,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:11,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083159117] [2019-11-25 08:51:11,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:11,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:11,303 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:11,303 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:11,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:11,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:11,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:11,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:11,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:11,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2019-11-25 08:51:11,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:11,305 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:11,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:11,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:11,788 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:11,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:11,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:11,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:11,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:11,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:11,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:11,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:11,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:11,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:11,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:11,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:12,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:12,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:12,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:12,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:12,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:12,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:12,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:12,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:12,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:12,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:12,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:12,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:12,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:12,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:12,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:12,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:12,149 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:51:12,150 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:12,224 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:51:12,227 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:51:12,228 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:12,228 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-25 08:51:12,242 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:51:12,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:12,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:51:12,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:12,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 08:51:12,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:51:12,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:51:12,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:51:12,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:51:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:12,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:51:12,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:12,429 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 [2019-11-25 08:51:12,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-25 08:51:12,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-25 08:51:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:51:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:51:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-25 08:51:12,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-25 08:51:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-25 08:51:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-25 08:51:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:12,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-25 08:51:12,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:12,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-25 08:51:12,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-25 08:51:12,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:51:12,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-25 08:51:12,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:12,560 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:51:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-25 08:51:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-25 08:51:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:51:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-25 08:51:12,586 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:51:12,586 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:51:12,586 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:51:12,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-25 08:51:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:12,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:12,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:12,588 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:12,588 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:12,588 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#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; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-25 08:51:12,588 INFO L796 eck$LassoCheckResult]: Loop: 128#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); 130#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; 128#L378-2 [2019-11-25 08:51:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-25 08:51:12,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:12,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611914245] [2019-11-25 08:51:12,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:12,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611914245] [2019-11-25 08:51:12,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:12,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:51:12,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164226558] [2019-11-25 08:51:12,693 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:51:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-25 08:51:12,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:12,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090707618] [2019-11-25 08:51:12,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,720 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:12,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:12,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:51:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:51:12,772 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:51:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:12,812 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-25 08:51:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:51:12,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-25 08:51:12,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:12,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:51:12,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:51:12,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:51:12,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-25 08:51:12,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:12,817 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:51:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-25 08:51:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-25 08:51:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:51:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-25 08:51:12,819 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:51:12,819 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:51:12,819 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:51:12,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-25 08:51:12,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:12,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:12,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:12,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:12,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:12,821 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#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; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#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); 158#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-25 08:51:12,821 INFO L796 eck$LassoCheckResult]: Loop: 161#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); 163#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; 161#L378-2 [2019-11-25 08:51:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-25 08:51:12,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:12,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812801998] [2019-11-25 08:51:12,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:12,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-25 08:51:12,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:12,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218051460] [2019-11-25 08:51:12,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,899 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-25 08:51:12,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:12,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758790781] [2019-11-25 08:51:12,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:12,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:13,199 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-25 08:51:13,257 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:13,257 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:13,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:13,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:13,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:13,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,258 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:13,258 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:13,258 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2019-11-25 08:51:13,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:13,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:13,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:13,665 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:13,665 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:13,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:13,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:13,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:13,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:13,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:13,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:13,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:13,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:13,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:13,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:13,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:13,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:13,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:13,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:13,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:13,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:13,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:13,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:13,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:13,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:13,854 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-25 08:51:13,854 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:13,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:13,873 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:51:13,874 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:13,874 INFO L512 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 [] [2019-11-25 08:51:13,889 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-25 08:51:13,891 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:13,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:51:13,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:13,941 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:51:13,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:13,961 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 [2019-11-25 08:51:13,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-25 08:51:14,004 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. [2019-11-25 08:51:14,004 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 [2019-11-25 08:51:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:51:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-25 08:51:14,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-25 08:51:14,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:14,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-25 08:51:14,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:14,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-25 08:51:14,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:14,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-25 08:51:14,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:14,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:51:14,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:51:14,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:51:14,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-25 08:51:14,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:14,008 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:51:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-25 08:51:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-25 08:51:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:51:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:51:14,010 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:51:14,010 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:51:14,010 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:51:14,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-25 08:51:14,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:14,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:14,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:14,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:14,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:14,012 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 260#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; 261#L367 assume !(main_~length~0 < 1); 272#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 273#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 274#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); 262#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 263#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 275#L370-3 assume !(main_~i~0 < main_~length~0); 264#L370-4 main_~j~0 := 0; 265#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); 271#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; 267#L378-2 [2019-11-25 08:51:14,012 INFO L796 eck$LassoCheckResult]: Loop: 267#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); 268#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; 267#L378-2 [2019-11-25 08:51:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-25 08:51:14,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080534190] [2019-11-25 08:51:14,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-25 08:51:14,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217901997] [2019-11-25 08:51:14,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-25 08:51:14,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396628945] [2019-11-25 08:51:14,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396628945] [2019-11-25 08:51:14,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213513068] [2019-11-25 08:51:14,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:14,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:51:14,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:14,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:14,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-25 08:51:14,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513322104] [2019-11-25 08:51:14,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:51:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:51:14,425 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-25 08:51:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:14,626 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-25 08:51:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:51:14,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-25 08:51:14,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:14,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-25 08:51:14,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:51:14,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:51:14,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-25 08:51:14,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:14,629 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-25 08:51:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-25 08:51:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-25 08:51:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:51:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-25 08:51:14,631 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:51:14,631 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:51:14,631 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:51:14,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-25 08:51:14,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:14,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:14,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:14,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:14,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:14,633 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#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; 377#L367 assume !(main_~length~0 < 1); 386#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 387#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 388#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); 391#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 389#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 390#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); 374#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 375#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L370-3 assume !(main_~i~0 < main_~length~0); 378#L370-4 main_~j~0 := 0; 379#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); 385#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; 381#L378-2 [2019-11-25 08:51:14,633 INFO L796 eck$LassoCheckResult]: Loop: 381#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); 382#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; 381#L378-2 [2019-11-25 08:51:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-25 08:51:14,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833533538] [2019-11-25 08:51:14,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-25 08:51:14,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711392556] [2019-11-25 08:51:14,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,685 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-25 08:51:14,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:14,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003452496] [2019-11-25 08:51:14,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:14,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:15,052 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-11-25 08:51:15,112 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:15,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:15,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:15,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:15,112 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:15,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:15,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:15,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:15,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2019-11-25 08:51:15,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:15,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:15,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:15,520 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:15,521 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:15,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:15,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:15,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:15,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:15,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:15,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:15,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:15,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:15,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:15,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:15,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:15,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:15,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:15,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:15,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:15,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:15,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:15,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:15,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:15,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:15,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:15,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:15,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:15,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:15,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:15,645 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-25 08:51:15,645 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:15,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:51:15,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:51:15,650 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:15,651 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 Supporting invariants [] [2019-11-25 08:51:15,659 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:51:15,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:15,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:51:15,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:15,705 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:51:15,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:15,724 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 [2019-11-25 08:51:15,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-25 08:51:15,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 23 states and 31 transitions. Complement of second has 6 states. [2019-11-25 08:51:15,761 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 [2019-11-25 08:51:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:51:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-25 08:51:15,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-25 08:51:15,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:15,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-25 08:51:15,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:15,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-25 08:51:15,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:15,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-25 08:51:15,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:15,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-25 08:51:15,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:15,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:51:15,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-25 08:51:15,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:15,765 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:51:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-25 08:51:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-25 08:51:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:51:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-25 08:51:15,768 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:51:15,768 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:51:15,768 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:51:15,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-25 08:51:15,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:51:15,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:15,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:15,770 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:15,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:51:15,770 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#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; 514#L367 assume !(main_~length~0 < 1); 523#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 524#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 525#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); 529#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 526#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 527#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); 511#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 512#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 530#L370-3 assume !(main_~i~0 < main_~length~0); 515#L370-4 main_~j~0 := 0; 516#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); 522#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; 528#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); 531#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; 518#L378-2 [2019-11-25 08:51:15,770 INFO L796 eck$LassoCheckResult]: Loop: 518#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); 519#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; 518#L378-2 [2019-11-25 08:51:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-25 08:51:15,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:15,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340622272] [2019-11-25 08:51:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:15,793 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-25 08:51:15,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:15,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729368056] [2019-11-25 08:51:15,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:15,799 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-25 08:51:15,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:15,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890200532] [2019-11-25 08:51:15,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:15,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890200532] [2019-11-25 08:51:15,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235551044] [2019-11-25 08:51:15,963 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:16,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-25 08:51:16,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:51:16,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:51:16,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:16,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:16,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-25 08:51:16,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384058934] [2019-11-25 08:51:16,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 08:51:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:51:16,115 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-25 08:51:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:16,278 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-25 08:51:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:51:16,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-25 08:51:16,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:51:16,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-25 08:51:16,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-25 08:51:16,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-25 08:51:16,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-25 08:51:16,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:16,281 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-25 08:51:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-25 08:51:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-25 08:51:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:51:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-25 08:51:16,285 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-25 08:51:16,285 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-25 08:51:16,285 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:51:16,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-25 08:51:16,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:51:16,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:16,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:16,287 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:16,287 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-25 08:51:16,288 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 664#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; 665#L367 assume !(main_~length~0 < 1); 676#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 677#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 678#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); 684#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 687#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 685#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); 686#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 680#L370-3 assume !(main_~i~0 < main_~length~0); 668#L370-4 main_~j~0 := 0; 669#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); 689#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; 688#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); 682#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; 683#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); 697#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; 695#L378-2 [2019-11-25 08:51:16,288 INFO L796 eck$LassoCheckResult]: Loop: 695#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); 692#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; 671#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); 672#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; 695#L378-2 [2019-11-25 08:51:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-25 08:51:16,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:16,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648765056] [2019-11-25 08:51:16,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-25 08:51:16,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:16,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953225754] [2019-11-25 08:51:16,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-25 08:51:16,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:16,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11634173] [2019-11-25 08:51:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:16,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:16,798 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2019-11-25 08:51:16,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:51:16 BoogieIcfgContainer [2019-11-25 08:51:16,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:51:16,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:51:16,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:51:16,915 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:51:16,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:10" (3/4) ... [2019-11-25 08:51:16,929 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:51:17,004 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_acfc7dab-6a39-4d42-bd64-428196a4c3ca/bin/uautomizer/witness.graphml [2019-11-25 08:51:17,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:51:17,005 INFO L168 Benchmark]: Toolchain (without parser) took 7104.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -283.0 MB). Peak memory consumption was 250.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,006 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:17,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -221.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:17,007 INFO L168 Benchmark]: Boogie Preprocessor took 23.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,007 INFO L168 Benchmark]: RCFGBuilder took 342.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,008 INFO L168 Benchmark]: BuchiAutomizer took 6108.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 917.0 MB in the end (delta: 223.0 MB). Peak memory consumption was 264.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,008 INFO L168 Benchmark]: Witness Printer took 89.42 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Free memory was 917.0 MB in the beginning and 1.2 GB in the end (delta: -306.7 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2019-11-25 08:51:17,010 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -221.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6108.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 917.0 MB in the end (delta: 223.0 MB). Peak memory consumption was 264.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.42 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Free memory was 917.0 MB in the beginning and 1.2 GB in the end (delta: -306.7 MB). Peak memory consumption was 8.2 kB. 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 - 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 unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 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 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. 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: 51 SDtfs, 161 SDslu, 76 SDs, 0 SdLazy, 230 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp63 div100 bol100 ite100 ukn100 eq159 hnf90 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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 {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b7b6deb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e64324c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18c5b96f=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@477670c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18c5b96f=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@17d1bf7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@27f33c38=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@34dfaac9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@f5a1a72=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) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...