./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array14_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_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array14_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/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 519b4f74907cdda12f126cdccb2c6422dda5240e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:47,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:47,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:47,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:47,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:47,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:47,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:47,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:47,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:47,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:47,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:47,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:47,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:47,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:47,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:47,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:47,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:47,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:47,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:47,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:47,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:47,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:47,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:47,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:47,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:47,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:47,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:47,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:47,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:47,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:47,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:47,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:47,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:47,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:47,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:47,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:47,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:47,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:47,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:47,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:47,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:47,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:26:47,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:47,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:47,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:47,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:47,215 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:47,216 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:26:47,216 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:26:47,216 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:26:47,216 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:26:47,217 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:26:47,217 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:26:47,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:47,217 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:26:47,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:47,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:47,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:26:47,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:26:47,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:26:47,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:47,219 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:26:47,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:47,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:26:47,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:47,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:47,220 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:26:47,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:47,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:47,221 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:26:47,222 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:26:47,222 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_3139ae1c-3875-4e41-86c1-967adfc5c151/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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2019-11-15 23:26:47,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:47,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:47,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:47,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:47,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:47,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/../../sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-15 23:26:47,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/data/ce4ae06ee/7d201df7cdf14c0f99808897c092e846/FLAG16f515d33 [2019-11-15 23:26:47,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:47,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-15 23:26:47,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/data/ce4ae06ee/7d201df7cdf14c0f99808897c092e846/FLAG16f515d33 [2019-11-15 23:26:48,285 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/data/ce4ae06ee/7d201df7cdf14c0f99808897c092e846 [2019-11-15 23:26:48,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:48,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:48,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:48,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:48,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:48,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4deedcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48, skipping insertion in model container [2019-11-15 23:26:48,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,319 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:48,355 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:48,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:48,747 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:48,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:48,869 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:48,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48 WrapperNode [2019-11-15 23:26:48,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:48,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:48,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:48,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:48,878 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:26:48" (1/1) ... [2019-11-15 23:26:48,890 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:26:48" (1/1) ... [2019-11-15 23:26:48,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:48,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:48,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:48,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:48,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... [2019-11-15 23:26:48,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:48,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:48,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:48,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:48,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/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:26:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:26:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:26:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:26:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:26:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:48,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:49,188 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:26:49,189 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:26:49,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:49 BoogieIcfgContainer [2019-11-15 23:26:49,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:26:49,191 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:26:49,191 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:26:49,194 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:26:49,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:49,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:26:48" (1/3) ... [2019-11-15 23:26:49,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12acc346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:26:49, skipping insertion in model container [2019-11-15 23:26:49,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:49,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:48" (2/3) ... [2019-11-15 23:26:49,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12acc346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:26:49, skipping insertion in model container [2019-11-15 23:26:49,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:26:49,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:49" (3/3) ... [2019-11-15 23:26:49,199 INFO L371 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2019-11-15 23:26:49,259 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:26:49,259 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:26:49,259 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:26:49,259 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:26:49,259 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:26:49,260 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:26:49,260 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:26:49,261 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:26:49,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:26:49,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:26:49,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:49,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:49,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:26:49,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:26:49,299 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:26:49,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:26:49,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:26:49,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:49,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:49,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:26:49,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:26:49,306 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:26:49,306 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:26:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 23:26:49,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:49,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277332135] [2019-11-15 23:26:49,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,421 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-15 23:26:49,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:49,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465517042] [2019-11-15 23:26:49,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,446 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-15 23:26:49,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:49,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591079143] [2019-11-15 23:26:49,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:49,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:49,484 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:49,692 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 23:26:49,741 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:26:49,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:26:49,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:26:49,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:26:49,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:26:49,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:26:49,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:26:49,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:26:49,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2019-11-15 23:26:49,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:26:49,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:26:49,772 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:26:49,779 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:26:49,781 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:26:49,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:49,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:49,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:49,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:49,802 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:26:49,804 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:26:49,809 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:26:49,939 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:26:49,945 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:26:50,208 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:26:50,214 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:26:50,216 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:26:50,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,220 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,221 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,224 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:26:50,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,228 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:26:50,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,228 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,229 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,231 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:26:50,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,232 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,234 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:26:50,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:50,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:50,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,244 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:26:50,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,246 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,247 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:26:50,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,271 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:26:50,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,272 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:50,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:50,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:50,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,274 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:26:50,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:50,277 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:50,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:50,281 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:26:50,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:50,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:50,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:50,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:50,288 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:50,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:50,397 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:26:50,431 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:26:50,431 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:26:50,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:26:50,434 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:26:50,435 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:26:50,435 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:26:50,444 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:26:50,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:26:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:50,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:26:50,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:26:50,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:50,516 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:26:50,530 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:26:50,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-15 23:26:50,578 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:26:50,579 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:26:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:26:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-15 23:26:50,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 23:26:50,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:50,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 23:26:50,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:50,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 23:26:50,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:50,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-11-15 23:26:50,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:50,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-11-15 23:26:50,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:26:50,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:26:50,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-15 23:26:50,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:26:50,600 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:26:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-15 23:26:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 23:26:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:26:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-15 23:26:50,631 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:26:50,631 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:26:50,631 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:26:50,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-15 23:26:50,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:50,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:50,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:50,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:50,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:50,635 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:26:50,636 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:26:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-15 23:26:50,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:50,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211100724] [2019-11-15 23:26:50,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:50,711 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:26:50,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211100724] [2019-11-15 23:26:50,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:26:50,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:26:50,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059925366] [2019-11-15 23:26:50,715 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:26:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-15 23:26:50,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:50,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983805262] [2019-11-15 23:26:50,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,726 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:50,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:26:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:26:50,775 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 23:26:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:50,808 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-15 23:26:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:26:50,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-15 23:26:50,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:50,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 23:26:50,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:26:50,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:26:50,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 23:26:50,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:26:50,812 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:26:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 23:26:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-15 23:26:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:26:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 23:26:50,813 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:26:50,814 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:26:50,814 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:26:50,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 23:26:50,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:50,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:50,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:50,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:50,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:50,816 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:26:50,816 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:26:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-15 23:26:50,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:50,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853180572] [2019-11-15 23:26:50,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-15 23:26:50,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:50,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797811110] [2019-11-15 23:26:50,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-15 23:26:50,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:50,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936629644] [2019-11-15 23:26:50,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:50,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:50,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:51,106 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-15 23:26:51,182 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:26:51,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:26:51,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:26:51,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:26:51,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:26:51,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:26:51,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:26:51,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:26:51,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2019-11-15 23:26:51,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:26:51,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:26:51,185 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:26:51,189 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:26:51,191 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:26:51,337 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:26:51,341 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:26:51,344 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:26:51,346 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:26:51,348 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:26:51,350 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:26:51,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:51,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:26:51,357 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:26:51,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:26:51,571 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:26:51,571 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:26:51,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:51,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:51,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:51,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:51,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:51,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:51,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:51,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:51,574 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:26:51,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:51,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:51,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:51,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:51,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:51,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:51,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:51,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:51,578 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:26:51,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:51,579 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:26:51,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:51,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:51,582 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:26:51,582 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:51,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:51,591 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:26:51,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:51,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:51,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:51,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:51,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:51,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:51,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:51,596 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:26:51,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:51,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:51,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:51,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:51,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:51,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:51,631 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:26:51,657 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:26:51,657 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:26:51,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:26:51,658 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:26:51,659 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:26:51,659 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:26:51,675 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:26:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:51,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:26:51,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:51,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:26:51,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:51,730 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:26:51,731 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:26:51,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 23:26:51,746 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:26:51,747 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:26:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:26:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 23:26:51,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 23:26:51,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:51,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 23:26:51,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:51,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:26:51,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:51,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-15 23:26:51,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:51,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:26:51,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:26:51,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:26:51,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 23:26:51,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:51,751 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:26:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 23:26:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:26:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:26:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:26:51,755 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:26:51,755 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:26:51,755 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:26:51,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 23:26:51,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:51,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:51,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:51,757 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:51,757 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:51,758 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:26:51,758 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:26:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-15 23:26:51,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:51,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595005640] [2019-11-15 23:26:51,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:51,778 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-15 23:26:51,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:51,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134535292] [2019-11-15 23:26:51,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:51,785 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-15 23:26:51,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:51,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414299394] [2019-11-15 23:26:51,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:51,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:51,959 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:26:51,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414299394] [2019-11-15 23:26:51,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513095236] [2019-11-15 23:26:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/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:26:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:52,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:26:52,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:52,079 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:26:52,079 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:26:52,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-15 23:26:52,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886380061] [2019-11-15 23:26:52,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:26:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:26:52,117 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-15 23:26:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:52,298 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-15 23:26:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:26:52,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-15 23:26:52,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:52,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-15 23:26:52,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:26:52,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:26:52,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-15 23:26:52,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:52,301 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 23:26:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-15 23:26:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 23:26:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:26:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 23:26:52,303 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:26:52,303 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 23:26:52,303 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:26:52,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 23:26:52,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:52,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:52,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:52,305 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:52,305 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:52,305 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:26:52,305 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:26:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:52,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-15 23:26:52,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:52,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409176789] [2019-11-15 23:26:52,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-15 23:26:52,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:52,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018470524] [2019-11-15 23:26:52,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,371 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-15 23:26:52,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:52,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431466266] [2019-11-15 23:26:52,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:52,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:52,391 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:52,671 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-11-15 23:26:52,720 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:26:52,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:26:52,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:26:52,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:26:52,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:26:52,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:26:52,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:26:52,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:26:52,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2019-11-15 23:26:52,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:26:52,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:26:52,724 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:26:52,732 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:26:52,735 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:26:52,737 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:26:52,876 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-15 23:26:52,942 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:26:52,945 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:26:52,948 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:26:52,950 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:26:52,952 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:26:52,954 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:26:52,956 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:26:53,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:26:53,203 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:26:53,204 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:26:53,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:53,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:53,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:53,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:53,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:53,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:53,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:53,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:53,206 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:26:53,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:53,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:53,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:53,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:53,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:53,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:53,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:53,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:26:53,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:53,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:26:53,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:53,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:53,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:53,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:26:53,210 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:26:53,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:53,211 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:26:53,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:53,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:53,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:53,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:53,213 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:53,213 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:53,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:26:53,229 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:26:53,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:26:53,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:26:53,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:26:53,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:26:53,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:26:53,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:26:53,256 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:26:53,269 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:26:53,269 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:26:53,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:26:53,270 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:26:53,270 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:26:53,270 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:26:53,279 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 23:26:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:53,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:26:53,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:53,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:26:53,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:53,330 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:26:53,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:26:53,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:26:53,344 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:26:53,345 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:26:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:26:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 23:26:53,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 23:26:53,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:53,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 23:26:53,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:53,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:26:53,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:26:53,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-15 23:26:53,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:53,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 23:26:53,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:26:53,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:26:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-15 23:26:53,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:53,349 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:26:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-15 23:26:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:26:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:26:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 23:26:53,351 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:26:53,351 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 23:26:53,351 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:26:53,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-15 23:26:53,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:26:53,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:53,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:53,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:53,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:26:53,353 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:26:53,353 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:26:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-15 23:26:53,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952221701] [2019-11-15 23:26:53,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,387 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-15 23:26:53,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327034953] [2019-11-15 23:26:53,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,395 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-15 23:26:53,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850774168] [2019-11-15 23:26:53,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:26:53,547 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:26:53,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850774168] [2019-11-15 23:26:53,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225750744] [2019-11-15 23:26:53,548 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/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:26:53,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:26:53,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:26:53,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:26:53,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:26:53,693 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:26:53,693 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:26:53,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-15 23:26:53,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649263931] [2019-11-15 23:26:53,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:26:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:26:53,724 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-15 23:26:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:26:53,919 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-15 23:26:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:26:53,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-15 23:26:53,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:26:53,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-15 23:26:53,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:26:53,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 23:26:53,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-15 23:26:53,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:26:53,922 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-15 23:26:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-15 23:26:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-15 23:26:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:26:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-15 23:26:53,927 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-15 23:26:53,927 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-15 23:26:53,927 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:26:53,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-15 23:26:53,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:26:53,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:26:53,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:26:53,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:26:53,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-15 23:26:53,930 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:26:53,930 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:26:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-15 23:26:53,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944719606] [2019-11-15 23:26:53,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-15 23:26:53,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492182817] [2019-11-15 23:26:53,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:26:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-15 23:26:53,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:26:53,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252866764] [2019-11-15 23:26:53,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:26:53,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:26:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:26:53,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:26:54,374 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 106 [2019-11-15 23:26:54,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:26:54 BoogieIcfgContainer [2019-11-15 23:26:54,464 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:26:54,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:26:54,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:26:54,465 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:26:54,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:26:49" (3/4) ... [2019-11-15 23:26:54,468 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:26:54,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3139ae1c-3875-4e41-86c1-967adfc5c151/bin/uautomizer/witness.graphml [2019-11-15 23:26:54,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:26:54,551 INFO L168 Benchmark]: Toolchain (without parser) took 6262.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 938.0 MB in the beginning and 774.9 MB in the end (delta: 163.1 MB). Peak memory consumption was 368.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,551 INFO L168 Benchmark]: CDTParser took 0.20 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:26:54,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,553 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:54,554 INFO L168 Benchmark]: RCFGBuilder took 258.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,554 INFO L168 Benchmark]: BuchiAutomizer took 5273.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 786.4 MB in the end (delta: 264.1 MB). Peak memory consumption was 364.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,558 INFO L168 Benchmark]: Witness Printer took 84.61 ms. Allocated memory is still 1.2 GB. Free memory was 786.4 MB in the beginning and 774.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:54,561 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.20 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 581.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 258.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5273.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 786.4 MB in the end (delta: 264.1 MB). Peak memory consumption was 364.3 MB. Max. memory is 11.5 GB. * Witness Printer took 84.61 ms. Allocated memory is still 1.2 GB. Free memory was 786.4 MB in the beginning and 774.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 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 5.2s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s 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: 12ms 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@d1a2fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f55f9d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ed54d10=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@704f426f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ed54d10=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@49af6c92=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@41056044=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5c1b901e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@41dda0bb=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i