./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array15_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-678e011 [2019-11-20 02:23:52,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:23:52,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:23:52,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:23:52,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:23:52,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:23:52,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:23:52,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:23:52,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:23:52,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:23:52,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:23:52,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:23:52,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:23:52,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:23:52,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:23:52,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:23:52,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:23:52,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:23:52,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:23:52,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:23:52,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:23:52,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:23:52,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:23:52,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:23:52,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:23:52,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:23:52,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:23:52,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:23:52,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:23:52,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:23:52,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:23:52,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:23:52,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:23:52,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:23:52,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:23:52,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:23:52,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:23:52,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:23:52,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:23:52,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:23:52,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:23:52,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 02:23:53,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:23:53,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:23:53,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:23:53,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:23:53,010 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:23:53,010 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 02:23:53,010 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 02:23:53,011 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 02:23:53,011 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 02:23:53,011 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 02:23:53,011 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 02:23:53,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:23:53,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:23:53,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:23:53,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:23:53,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 02:23:53,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 02:23:53,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 02:23:53,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:23:53,013 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 02:23:53,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:23:53,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 02:23:53,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:23:53,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:23:53,015 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 02:23:53,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:23:53,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:23:53,016 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 02:23:53,016 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 02:23:53,017 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_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:53,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:23:53,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:23:53,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:23:53,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:23:53,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:23:53,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/../../sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-20 02:23:53,282 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/data/2e30ff009/8914030c55b941b7ab3fafabae72a203/FLAG108e521cd [2019-11-20 02:23:53,747 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:23:53,747 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-20 02:23:53,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/data/2e30ff009/8914030c55b941b7ab3fafabae72a203/FLAG108e521cd [2019-11-20 02:23:54,016 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/data/2e30ff009/8914030c55b941b7ab3fafabae72a203 [2019-11-20 02:23:54,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:23:54,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:23:54,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:23:54,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:23:54,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:23:54,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45654f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54, skipping insertion in model container [2019-11-20 02:23:54,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,037 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:23:54,083 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:23:54,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:23:54,473 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:23:54,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:23:54,579 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:23:54,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54 WrapperNode [2019-11-20 02:23:54,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:23:54,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:23:54,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:23:54,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:23:54,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:23:54,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:23:54,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:23:54,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:23:54,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... [2019-11-20 02:23:54,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:23:54,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:23:54,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:23:54,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:23:54,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:23:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:23:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:23:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:23:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:23:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:23:55,030 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:23:55,030 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-20 02:23:55,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:55 BoogieIcfgContainer [2019-11-20 02:23:55,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:23:55,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 02:23:55,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 02:23:55,035 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 02:23:55,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:55,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 02:23:54" (1/3) ... [2019-11-20 02:23:55,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3792e5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:23:55, skipping insertion in model container [2019-11-20 02:23:55,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:55,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:54" (2/3) ... [2019-11-20 02:23:55,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3792e5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:23:55, skipping insertion in model container [2019-11-20 02:23:55,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:55,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:55" (3/3) ... [2019-11-20 02:23:55,040 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2019-11-20 02:23:55,089 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 02:23:55,089 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 02:23:55,089 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 02:23:55,089 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:23:55,090 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:23:55,090 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 02:23:55,090 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:23:55,090 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 02:23:55,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-20 02:23:55,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-20 02:23:55,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:55,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:55,134 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:23:55,134 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:23:55,134 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 02:23:55,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-20 02:23:55,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-20 02:23:55,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:55,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:55,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:23:55,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:23:55,145 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-20 02:23:55,145 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-20 02:23:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-20 02:23:55,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455490291] [2019-11-20 02:23:55,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-20 02:23:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588160705] [2019-11-20 02:23:55,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-20 02:23:55,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847013452] [2019-11-20 02:23:55,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,567 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-20 02:23:55,624 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:23:55,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:23:55,625 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:23:55,625 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:23:55,625 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:23:55,625 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:55,625 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:23:55,626 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:23:55,626 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2019-11-20 02:23:55,626 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:23:55,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:23:55,654 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-20 02:23:55,661 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-20 02:23:55,669 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-20 02:23:55,672 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-20 02:23:55,675 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-20 02:23:55,686 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-20 02:23:55,691 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-20 02:23:55,694 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-20 02:23:55,696 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-20 02:23:55,701 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-20 02:23:55,827 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-20 02:23:55,830 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-20 02:23:56,089 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:23:56,095 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,112 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-20 02:23:56,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:56,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:56,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,138 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-20 02:23:56,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,143 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-20 02:23:56,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,164 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-20 02:23:56,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,167 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-20 02:23:56,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,188 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-20 02:23:56,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,191 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-20 02:23:56,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,209 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-20 02:23:56,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:56,222 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-20 02:23:56,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) [2019-11-20 02:23:56,248 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-20 02:23:56,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:56,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,276 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-20 02:23:56,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,281 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-20 02:23:56,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,303 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-20 02:23:56,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:56,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:56,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:56,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:56,326 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-20 02:23:56,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:56,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:56,336 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-20 02:23:56,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) [2019-11-20 02:23:56,359 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-20 02:23:56,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:56,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:56,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:56,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:56,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:56,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:56,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:23:56,526 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 02:23:56,526 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_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) [2019-11-20 02:23:56,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:56,597 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 02:23:56,597 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:23:56,598 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-20 02:23:56,617 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 02:23:56,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 02:23:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:56,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:23:56,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:56,737 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-20 02:23:56,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:56,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:56,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:56,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 02:23:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:56,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:23:56,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:56,813 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-20 02:23:56,829 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-20 02:23:56,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-20 02:23:56,959 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-20 02:23:56,960 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-20 02:23:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:23:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-20 02:23:56,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 02:23:56,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:56,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 02:23:56,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:56,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 02:23:56,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:56,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-20 02:23:56,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:56,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-20 02:23:56,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 02:23:56,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 02:23:56,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-20 02:23:56,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:23:56,990 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-20 02:23:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-20 02:23:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-20 02:23:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 02:23:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-20 02:23:57,021 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-20 02:23:57,022 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-20 02:23:57,022 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 02:23:57,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-20 02:23:57,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:57,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:57,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:57,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:57,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:23:57,026 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-20 02:23:57,026 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-20 02:23:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-20 02:23:57,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652164498] [2019-11-20 02:23:57,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:57,129 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-20 02:23:57,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652164498] [2019-11-20 02:23:57,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:57,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:23:57,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068302916] [2019-11-20 02:23:57,133 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 02:23:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-20 02:23:57,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498794566] [2019-11-20 02:23:57,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:57,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:23:57,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:23:57,219 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 02:23:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:57,260 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-20 02:23:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:23:57,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-20 02:23:57,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:57,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 02:23:57,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 02:23:57,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-20 02:23:57,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-20 02:23:57,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:23:57,265 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 02:23:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-20 02:23:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-20 02:23:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 02:23:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-20 02:23:57,267 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-20 02:23:57,267 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-20 02:23:57,267 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 02:23:57,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-20 02:23:57,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:57,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:57,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:57,276 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:57,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:23:57,277 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-20 02:23:57,278 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-20 02:23:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-20 02:23:57,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768355474] [2019-11-20 02:23:57,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-20 02:23:57,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434205734] [2019-11-20 02:23:57,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-20 02:23:57,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137040271] [2019-11-20 02:23:57,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:57,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:57,659 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-20 02:23:57,734 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:23:57,735 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:23:57,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:23:57,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:23:57,735 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:23:57,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:23:57,736 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:23:57,736 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2019-11-20 02:23:57,736 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:23:57,736 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:23:57,740 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-20 02:23:57,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:57,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:57,757 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-20 02:23:57,949 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-20 02:23:57,953 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-20 02:23:57,955 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-20 02:23:57,957 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-20 02:23:57,959 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-20 02:23:57,962 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-20 02:23:57,966 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-20 02:23:57,975 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-20 02:23:58,252 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:23:58,253 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:58,266 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-20 02:23:58,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:58,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:58,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:58,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:58,291 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-20 02:23:58,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:58,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:58,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:58,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:58,311 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-20 02:23:58,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:58,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:58,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:58,328 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-20 02:23:58,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:58,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:58,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:58,350 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-20 02:23:58,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:58,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:58,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) [2019-11-20 02:23:58,378 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-20 02:23:58,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:58,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:58,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:58,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:58,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:58,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:58,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:23:58,452 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 02:23:58,452 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_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:58,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:23:58,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:23:58,458 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:23:58,458 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)_2) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 Supporting invariants [] [2019-11-20 02:23:58,466 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 02:23:58,468 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 02:23:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:23:58,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,522 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:23:58,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:58,553 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-20 02:23:58,553 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-20 02:23:58,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-20 02:23:58,608 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-20 02:23:58,608 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-20 02:23:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:23:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-20 02:23:58,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-20 02:23:58,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:58,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-20 02:23:58,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:58,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-20 02:23:58,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:58,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-20 02:23:58,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:58,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-20 02:23:58,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 02:23:58,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 02:23:58,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-20 02:23:58,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:58,612 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-20 02:23:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-20 02:23:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-20 02:23:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 02:23:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-20 02:23:58,614 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-20 02:23:58,614 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-20 02:23:58,614 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 02:23:58,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-20 02:23:58,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:58,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:58,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:58,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:58,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:23:58,617 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-20 02:23:58,617 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-20 02:23:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-20 02:23:58,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:58,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935800924] [2019-11-20 02:23:58,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-20 02:23:58,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:58,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712015038] [2019-11-20 02:23:58,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-20 02:23:58,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:58,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212484678] [2019-11-20 02:23:58,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,812 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-20 02:23:58,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212484678] [2019-11-20 02:23:58,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777438970] [2019-11-20 02:23:58,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:23:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 02:23:58,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:58,921 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-20 02:23:58,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:23:58,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 02:23:58,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479039654] [2019-11-20 02:23:58,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:23:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:23:58,972 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-20 02:23:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:59,173 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-20 02:23:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 02:23:59,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-20 02:23:59,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:59,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-20 02:23:59,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 02:23:59,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 02:23:59,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-20 02:23:59,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:59,176 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-20 02:23:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-20 02:23:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-20 02:23:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-20 02:23:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-20 02:23:59,178 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-20 02:23:59,178 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-20 02:23:59,179 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 02:23:59,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-20 02:23:59,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:23:59,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:59,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:59,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:59,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:23:59,180 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-20 02:23:59,181 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-20 02:23:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-20 02:23:59,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337524918] [2019-11-20 02:23:59,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-20 02:23:59,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326123686] [2019-11-20 02:23:59,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,221 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-20 02:23:59,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653840367] [2019-11-20 02:23:59,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,561 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-11-20 02:23:59,616 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:23:59,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:23:59,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:23:59,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:23:59,617 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:23:59,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:59,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:23:59,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:23:59,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2019-11-20 02:23:59,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:23:59,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:23:59,620 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-20 02:23:59,624 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-20 02:23:59,784 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-20 02:23:59,787 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-20 02:23:59,790 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-20 02:23:59,791 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-20 02:23:59,793 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-20 02:23:59,797 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-20 02:23:59,798 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-20 02:23:59,801 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-20 02:23:59,803 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-20 02:24:00,027 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:24:00,028 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:24:00,033 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-20 02:24:00,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:00,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:00,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:00,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:00,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:00,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:00,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:24:00,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:24:00,046 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-20 02:24:00,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:00,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:00,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:00,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:00,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:00,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:00,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:24:00,076 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-20 02:24:00,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:00,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:00,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:00,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:00,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:00,087 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-20 02:24:00,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:24:00,175 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-20 02:24:00,175 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_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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) [2019-11-20 02:24:00,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:00,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:24:00,186 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:24:00,186 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 + 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-20 02:24:00,208 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 02:24:00,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 02:24:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:00,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:24:00,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:00,274 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:24:00,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:00,323 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-20 02:24:00,323 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-20 02:24:00,324 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-20 02:24:00,391 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-20 02:24:00,392 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-20 02:24:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:24:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-20 02:24:00,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-20 02:24:00,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:00,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-20 02:24:00,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:00,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-20 02:24:00,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:00,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-20 02:24:00,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:24:00,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 02:24:00,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 02:24:00,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 02:24:00,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-20 02:24:00,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:24:00,396 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 02:24:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-20 02:24:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-20 02:24:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 02:24:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 02:24:00,399 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 02:24:00,399 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 02:24:00,399 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 02:24:00,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-20 02:24:00,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-20 02:24:00,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:24:00,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:24:00,401 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:24:00,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 02:24:00,401 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-20 02:24:00,401 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-20 02:24:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-20 02:24:00,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:00,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569837126] [2019-11-20 02:24:00,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:00,472 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:24:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-20 02:24:00,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:00,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338312941] [2019-11-20 02:24:00,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:00,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:24:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-20 02:24:00,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:00,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196513565] [2019-11-20 02:24:00,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:00,669 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-20 02:24:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196513565] [2019-11-20 02:24:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363230990] [2019-11-20 02:24:00,669 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/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-20 02:24:00,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 02:24:00,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:24:00,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:24:00,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:00,799 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-20 02:24:00,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:24:00,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-20 02:24:00,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570729788] [2019-11-20 02:24:00,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:24:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 02:24:00,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-20 02:24:00,829 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-20 02:24:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:01,026 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-20 02:24:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:24:01,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-20 02:24:01,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:24:01,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-20 02:24:01,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-20 02:24:01,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-20 02:24:01,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-20 02:24:01,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:24:01,030 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-20 02:24:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-20 02:24:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-20 02:24:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 02:24:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-20 02:24:01,034 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-20 02:24:01,034 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-20 02:24:01,034 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 02:24:01,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-20 02:24:01,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 02:24:01,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:24:01,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:24:01,036 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:24:01,036 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-20 02:24:01,037 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-20 02:24:01,037 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-20 02:24:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-20 02:24:01,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:01,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895175843] [2019-11-20 02:24:01,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:24:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-20 02:24:01,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:01,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76063021] [2019-11-20 02:24:01,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:24:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-20 02:24:01,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:24:01,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805445128] [2019-11-20 02:24:01,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:24:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:24:01,113 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:24:01,569 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2019-11-20 02:24:01,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 02:24:01 BoogieIcfgContainer [2019-11-20 02:24:01,682 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 02:24:01,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:24:01,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:24:01,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:24:01,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:55" (3/4) ... [2019-11-20 02:24:01,697 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 02:24:01,762 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c4f5e3e8-e32c-4b23-be44-316aa2ab3575/bin/uautomizer/witness.graphml [2019-11-20 02:24:01,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:24:01,764 INFO L168 Benchmark]: Toolchain (without parser) took 7743.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 145.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,764 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:24:01,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -237.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.40 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: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,766 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,766 INFO L168 Benchmark]: RCFGBuilder took 379.10 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,767 INFO L168 Benchmark]: BuchiAutomizer took 6649.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.9 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,767 INFO L168 Benchmark]: Witness Printer took 80.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:01,774 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 558.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -237.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.40 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: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.32 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.10 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6649.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.9 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. * Witness Printer took 80.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + 8 * j 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.5s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. 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: 32ms 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@3ec7397d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7164a2e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5afd43e9=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@612d813d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5afd43e9=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5a47f9cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@51b49f6c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7d52ade3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@11830712=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...