./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array15_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/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-cad4683 [2019-11-15 23:45:03,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:03,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:03,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:03,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:03,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:03,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:03,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:03,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:03,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:03,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:03,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:03,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:03,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:03,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:03,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:03,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:03,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:03,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:03,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:03,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:03,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:03,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:03,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:03,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:03,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:03,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:03,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:03,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:03,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:03,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:03,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:03,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:03,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:03,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:03,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:03,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:03,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:03,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:03,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:03,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:03,929 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:45:03,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:03,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:03,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:03,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:03,965 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:03,965 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:45:03,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:45:03,965 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:45:03,966 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:45:03,966 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:45:03,966 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:45:03,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:03,967 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:45:03,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:03,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:03,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:45:03,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:45:03,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:45:03,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:03,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:45:03,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:03,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:45:03,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:03,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:03,970 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:45:03,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:03,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:03,970 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:45:03,971 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:45:03,972 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_457633c2-d086-4b73-9372-34309ee179ab/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-15 23:45:04,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:04,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:04,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:04,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:04,052 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:04,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/../../sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-15 23:45:04,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/data/0e284f89a/0e5f2a6db3ab4107902a0ff8b4392db5/FLAGc62c39e55 [2019-11-15 23:45:04,702 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:04,702 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/sv-benchmarks/c/termination-15/array15_alloca.i [2019-11-15 23:45:04,716 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/data/0e284f89a/0e5f2a6db3ab4107902a0ff8b4392db5/FLAGc62c39e55 [2019-11-15 23:45:05,049 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/data/0e284f89a/0e5f2a6db3ab4107902a0ff8b4392db5 [2019-11-15 23:45:05,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:05,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:05,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:05,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:05,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:05,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1101df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05, skipping insertion in model container [2019-11-15 23:45:05,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:05,110 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:05,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:05,591 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:05,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:05,762 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:05,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05 WrapperNode [2019-11-15 23:45:05,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:05,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:05,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:05,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:05,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:05,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:05,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:05,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:05,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... [2019-11-15 23:45:05,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:05,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:05,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:05,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:05,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/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-15 23:45:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:45:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:45:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:45:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:45:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:05,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:06,231 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:06,231 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:45:06,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:06 BoogieIcfgContainer [2019-11-15 23:45:06,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:06,233 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:45:06,233 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:45:06,237 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:45:06,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:06,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:45:05" (1/3) ... [2019-11-15 23:45:06,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2204e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:45:06, skipping insertion in model container [2019-11-15 23:45:06,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:06,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:05" (2/3) ... [2019-11-15 23:45:06,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2204e716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:45:06, skipping insertion in model container [2019-11-15 23:45:06,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:06,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:06" (3/3) ... [2019-11-15 23:45:06,243 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2019-11-15 23:45:06,313 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:45:06,326 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:45:06,326 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:45:06,326 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:06,327 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:06,327 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:45:06,327 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:06,339 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:45:06,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:45:06,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:45:06,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:06,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:06,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:45:06,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:45:06,427 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:45:06,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:45:06,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:45:06,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:06,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:06,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:45:06,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:45:06,441 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.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-15 23:45:06,444 INFO L793 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-15 23:45:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 23:45:06,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:06,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426923987] [2019-11-15 23:45:06,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,660 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-15 23:45:06,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:06,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213616675] [2019-11-15 23:45:06,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,706 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-15 23:45:06,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:06,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341463374] [2019-11-15 23:45:06,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:06,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:06,751 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:06,998 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 23:45:07,072 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:45:07,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:45:07,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:45:07,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:45:07,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:45:07,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:45:07,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:45:07,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:45:07,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2019-11-15 23:45:07,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:45:07,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:45:07,095 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-15 23:45:07,103 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-15 23:45:07,110 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-15 23:45:07,114 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-15 23:45:07,119 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-15 23:45:07,124 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-15 23:45:07,128 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-15 23:45:07,131 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-15 23:45:07,134 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-15 23:45:07,144 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-15 23:45:07,277 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-15 23:45:07,312 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-15 23:45:07,314 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-15 23:45:07,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:45:07,613 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:45:07,617 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-15 23:45:07,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,631 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-15 23:45:07,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,637 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-15 23:45:07,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,647 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-15 23:45:07,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,659 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-15 23:45:07,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:07,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:07,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,676 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-15 23:45:07,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,682 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-15 23:45:07,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,688 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-15 23:45:07,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:07,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:07,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:07,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,696 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-15 23:45:07,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:07,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:07,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:07,719 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-15 23:45:07,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:07,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:07,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:07,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:07,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:07,725 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:07,813 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:45:07,838 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:45:07,838 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:45:07,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:45:07,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:45:07,842 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:45:07,843 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:45:07,853 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:45:07,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:45:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:07,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:45:07,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:07,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:07,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:07,960 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-15 23:45:07,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:45:07,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-15 23:45:08,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-11-15 23:45:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:45:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:45:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-15 23:45:08,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 23:45:08,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:08,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 23:45:08,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:08,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 23:45:08,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:08,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-11-15 23:45:08,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:08,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-11-15 23:45:08,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:45:08,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:45:08,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-15 23:45:08,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:45:08,060 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:45:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-15 23:45:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 23:45:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:45:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-15 23:45:08,090 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:45:08,090 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:45:08,090 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:45:08,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-15 23:45:08,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:08,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:08,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:08,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:08,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:45:08,094 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-11-15 23:45:08,095 INFO L793 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2019-11-15 23:45:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-15 23:45:08,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:08,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920661693] [2019-11-15 23:45:08,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:08,169 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-15 23:45:08,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920661693] [2019-11-15 23:45:08,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:08,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:08,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567174817] [2019-11-15 23:45:08,173 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:45:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-15 23:45:08,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:08,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302195814] [2019-11-15 23:45:08,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,185 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:08,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:08,246 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 23:45:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:08,281 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-15 23:45:08,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:08,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-15 23:45:08,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:08,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 23:45:08,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:45:08,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:45:08,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 23:45:08,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:45:08,285 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:45:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 23:45:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-15 23:45:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:45:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 23:45:08,287 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:45:08,287 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:45:08,288 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:45:08,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 23:45:08,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:08,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:08,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:08,289 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:08,289 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:45:08,290 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-11-15 23:45:08,290 INFO L793 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2019-11-15 23:45:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-15 23:45:08,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:08,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471539730] [2019-11-15 23:45:08,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-15 23:45:08,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:08,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075022423] [2019-11-15 23:45:08,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-15 23:45:08,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:08,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907065342] [2019-11-15 23:45:08,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:08,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:08,388 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:08,607 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-15 23:45:08,675 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:45:08,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:45:08,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:45:08,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:45:08,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:45:08,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:45:08,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:45:08,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:45:08,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2019-11-15 23:45:08,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:45:08,676 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:45:08,680 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-15 23:45:08,683 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-15 23:45:08,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-15 23:45:08,833 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-15 23:45:08,836 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-15 23:45:08,846 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-15 23:45:08,849 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-15 23:45:08,851 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-15 23:45:08,853 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-15 23:45:08,855 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-15 23:45:08,862 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-15 23:45:08,866 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-15 23:45:09,135 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:45:09,136 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:45:09,136 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-15 23:45:09,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:09,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:09,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:09,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:09,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:09,138 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:09,138 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:09,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:09,142 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-15 23:45:09,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:09,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:09,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:09,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:09,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:09,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:09,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:09,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:09,145 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-15 23:45:09,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:09,145 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:45:09,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:09,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:09,147 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:45:09,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:09,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:09,157 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-15 23:45:09,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:09,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:09,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:09,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:09,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:09,160 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:09,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:09,162 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-15 23:45:09,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:09,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:09,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:09,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:09,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:09,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:09,220 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:45:09,263 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:45:09,265 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:45:09,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:45:09,267 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:45:09,267 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:45:09,267 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-11-15 23:45:09,274 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:45:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:09,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:45:09,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:09,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:09,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:09,329 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-15 23:45:09,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:45:09,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 23:45:09,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-15 23:45:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:45:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:45:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 23:45:09,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 23:45:09,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:09,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 23:45:09,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:45:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:09,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-15 23:45:09,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:09,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:45:09,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:45:09,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:45:09,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 23:45:09,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:45:09,352 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:45:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 23:45:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:45:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:45:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:45:09,354 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:45:09,354 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:45:09,354 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:45:09,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 23:45:09,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:09,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:09,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:09,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:09,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:45:09,356 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#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; 246#L367 assume !(main_~length~0 < 1); 255#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; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#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); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#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); 254#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; 250#L378-2 [2019-11-15 23:45:09,356 INFO L793 eck$LassoCheckResult]: Loop: 250#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); 251#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; 250#L378-2 [2019-11-15 23:45:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-15 23:45:09,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:09,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833332016] [2019-11-15 23:45:09,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:09,429 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-15 23:45:09,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:09,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064965554] [2019-11-15 23:45:09,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:09,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-15 23:45:09,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:09,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792334652] [2019-11-15 23:45:09,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:09,633 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-15 23:45:09,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792334652] [2019-11-15 23:45:09,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629697029] [2019-11-15 23:45:09,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:09,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:45:09,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:09,830 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-15 23:45:09,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:09,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-15 23:45:09,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038377769] [2019-11-15 23:45:09,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:45:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:45:09,885 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-15 23:45:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:10,212 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-15 23:45:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:45:10,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-15 23:45:10,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:10,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-15 23:45:10,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:45:10,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:45:10,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-15 23:45:10,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:45:10,216 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 23:45:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-15 23:45:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 23:45:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:45:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 23:45:10,219 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:45:10,219 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:45:10,219 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:45:10,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 23:45:10,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:10,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:10,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:10,221 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:10,221 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:45:10,221 INFO L791 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#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; 360#L367 assume !(main_~length~0 < 1); 369#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; 370#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 371#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; 372#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 373#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); 357#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 358#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 375#L370-3 assume !(main_~i~0 < main_~length~0); 361#L370-4 main_~j~0 := 0; 362#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); 368#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; 364#L378-2 [2019-11-15 23:45:10,221 INFO L793 eck$LassoCheckResult]: Loop: 364#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); 365#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; 364#L378-2 [2019-11-15 23:45:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-15 23:45:10,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:10,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333935931] [2019-11-15 23:45:10,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,279 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-15 23:45:10,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:10,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190189901] [2019-11-15 23:45:10,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-15 23:45:10,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:10,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283533927] [2019-11-15 23:45:10,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:10,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:10,721 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-11-15 23:45:10,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:45:10,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:45:10,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:45:10,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:45:10,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:45:10,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:45:10,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:45:10,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:45:10,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2019-11-15 23:45:10,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:45:10,792 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:45:10,795 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-15 23:45:10,799 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-15 23:45:10,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-15 23:45:10,805 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-15 23:45:10,951 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-15 23:45:11,021 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-15 23:45:11,024 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-15 23:45:11,031 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-15 23:45:11,033 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-15 23:45:11,036 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-15 23:45:11,039 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-15 23:45:11,042 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-15 23:45:11,301 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:45:11,302 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:45:11,302 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-15 23:45:11,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:11,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:11,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:11,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:11,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:11,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:11,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:11,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:11,305 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-15 23:45:11,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:11,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:11,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:11,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:11,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:11,307 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:11,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:11,309 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-15 23:45:11,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:11,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:45:11,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:11,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:11,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:11,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:45:11,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:45:11,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:11,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-15 23:45:11,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:11,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:11,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:11,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:11,314 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:11,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:11,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:45:11,321 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-15 23:45:11,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:45:11,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:45:11,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:45:11,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:45:11,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:45:11,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:45:11,344 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:45:11,356 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:45:11,357 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:45:11,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:45:11,358 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:45:11,358 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:45:11,358 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-11-15 23:45:11,372 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 23:45:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:45:11,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:45:11,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:11,422 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-15 23:45:11,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:45:11,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:45:11,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2019-11-15 23:45:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:45:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:45:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 23:45:11,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 23:45:11,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:11,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 23:45:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:11,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:45:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:45:11,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-15 23:45:11,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:11,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 23:45:11,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:45:11,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:45:11,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-15 23:45:11,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:45:11,440 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:45:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-15 23:45:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:45:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:45:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 23:45:11,443 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:45:11,443 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:45:11,443 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:45:11,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-15 23:45:11,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:45:11,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:11,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:11,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:11,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:45:11,445 INFO L791 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 487#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; 488#L367 assume !(main_~length~0 < 1); 499#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; 500#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 501#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); 505#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 502#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 503#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); 489#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 490#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 506#L370-3 assume !(main_~i~0 < main_~length~0); 491#L370-4 main_~j~0 := 0; 492#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); 497#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; 504#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); 507#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; 494#L378-2 [2019-11-15 23:45:11,445 INFO L793 eck$LassoCheckResult]: Loop: 494#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); 495#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; 494#L378-2 [2019-11-15 23:45:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,446 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-15 23:45:11,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125007921] [2019-11-15 23:45:11,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:11,466 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-15 23:45:11,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567273052] [2019-11-15 23:45:11,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:11,473 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-15 23:45:11,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727658074] [2019-11-15 23:45:11,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,621 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-15 23:45:11,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727658074] [2019-11-15 23:45:11,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018800333] [2019-11-15 23:45:11,622 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:11,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:45:11,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:45:11,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:45:11,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:11,797 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-15 23:45:11,798 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:11,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-15 23:45:11,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938368508] [2019-11-15 23:45:11,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:45:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:45:11,834 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-15 23:45:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:12,063 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-15 23:45:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:45:12,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-15 23:45:12,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:45:12,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-15 23:45:12,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:45:12,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 23:45:12,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-15 23:45:12,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:45:12,066 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-15 23:45:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-15 23:45:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-15 23:45:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:45:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-15 23:45:12,071 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-15 23:45:12,071 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-15 23:45:12,071 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:45:12,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-15 23:45:12,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:45:12,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:12,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:12,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-15 23:45:12,074 INFO L791 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#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; 641#L367 assume !(main_~length~0 < 1); 652#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; 653#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 654#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); 659#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 662#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 660#L370-3 assume !!(main_~i~0 < main_~length~0);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); 661#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 655#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 656#L370-3 assume !(main_~i~0 < main_~length~0); 644#L370-4 main_~j~0 := 0; 645#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); 664#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; 663#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 657#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; 658#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 674#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 672#L378-2 [2019-11-15 23:45:12,074 INFO L793 eck$LassoCheckResult]: Loop: 672#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 670#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); 675#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; 672#L378-2 [2019-11-15 23:45:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-15 23:45:12,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293452899] [2019-11-15 23:45:12,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,095 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-15 23:45:12,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479476418] [2019-11-15 23:45:12,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-15 23:45:12,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888828512] [2019-11-15 23:45:12,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:12,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:12,676 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 106 [2019-11-15 23:45:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:45:12 BoogieIcfgContainer [2019-11-15 23:45:12,775 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:45:12,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:12,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:12,776 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:12,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:06" (3/4) ... [2019-11-15 23:45:12,779 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:45:12,829 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_457633c2-d086-4b73-9372-34309ee179ab/bin/uautomizer/witness.graphml [2019-11-15 23:45:12,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:12,831 INFO L168 Benchmark]: Toolchain (without parser) took 7776.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -364.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:12,832 INFO L168 Benchmark]: CDTParser took 0.35 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-15 23:45:12,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:12,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:12,833 INFO L168 Benchmark]: Boogie Preprocessor took 43.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:12,834 INFO L168 Benchmark]: RCFGBuilder took 375.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:12,834 INFO L168 Benchmark]: BuchiAutomizer took 6541.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.7 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:12,835 INFO L168 Benchmark]: Witness Printer took 54.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:12,838 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.35 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 701.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 375.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6541.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.7 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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[arr] + -1 * arr + -4 * i and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 166 SDslu, 76 SDs, 0 SdLazy, 215 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf98 lsp93 ukn83 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf89 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a2bbca7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@452b5292=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4363395a=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@51a485af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4363395a=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@511eb6d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@461d7f2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2d6c6b40=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@727abaf8=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...