./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.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_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/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 9016787135830d25851d4a1126db5f65005e4eb5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:16:11,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:16:11,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:16:11,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:16:11,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:16:11,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:16:11,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:16:11,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:16:11,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:16:11,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:16:11,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:16:11,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:16:11,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:16:11,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:16:11,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:16:11,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:16:11,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:16:11,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:16:11,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:16:11,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:16:11,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:16:11,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:16:11,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:16:11,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:16:11,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:16:11,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:16:11,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:16:11,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:16:11,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:16:11,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:16:11,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:16:11,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:16:11,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:16:11,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:16:11,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:16:11,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:16:11,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:16:11,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:16:11,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:16:11,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:16:11,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:16:11,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:16:11,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:16:11,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:16:11,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:16:11,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:16:11,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:16:11,380 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:16:11,380 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:16:11,381 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:16:11,381 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:16:11,381 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:16:11,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:16:11,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:16:11,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:16:11,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:16:11,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:16:11,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:16:11,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:16:11,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:16:11,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:16:11,385 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:16:11,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:16:11,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:16:11,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:16:11,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:16:11,386 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:16:11,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:16:11,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:16:11,387 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:16:11,388 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:16:11,389 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_8d836875-20d0-4bc2-8423-cc05b838b00a/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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2019-11-15 21:16:11,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:16:11,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:16:11,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:16:11,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:16:11,464 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:16:11,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2019-11-15 21:16:11,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/data/0d2266cb0/0578d77ee78c47ab80023bb0d9903bd7/FLAG9a4460198 [2019-11-15 21:16:12,031 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:16:12,032 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2019-11-15 21:16:12,049 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/data/0d2266cb0/0578d77ee78c47ab80023bb0d9903bd7/FLAG9a4460198 [2019-11-15 21:16:12,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/bin/uautomizer/data/0d2266cb0/0578d77ee78c47ab80023bb0d9903bd7 [2019-11-15 21:16:12,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:16:12,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:16:12,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:16:12,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:16:12,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:16:12,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f763e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12, skipping insertion in model container [2019-11-15 21:16:12,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,372 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:16:12,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:16:12,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:16:12,883 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:16:12,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:16:12,988 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:16:12,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12 WrapperNode [2019-11-15 21:16:12,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:16:12,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:16:12,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:16:12,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:16:13,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:16:13,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:16:13,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:16:13,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:16:13,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:13,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:16:13,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:16:13,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:16:13,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:16:13,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/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 21:16:13,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:16:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:16:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:16:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:16:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:16:13,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:16:13,497 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:16:13,497 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:16:13,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:16:13 BoogieIcfgContainer [2019-11-15 21:16:13,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:16:13,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:16:13,499 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:16:13,502 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:16:13,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:16:13,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:16:12" (1/3) ... [2019-11-15 21:16:13,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa868de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:16:13, skipping insertion in model container [2019-11-15 21:16:13,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:16:13,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (2/3) ... [2019-11-15 21:16:13,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa868de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:16:13, skipping insertion in model container [2019-11-15 21:16:13,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:16:13,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:16:13" (3/3) ... [2019-11-15 21:16:13,507 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2019-11-15 21:16:13,568 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:16:13,568 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:16:13,568 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:16:13,568 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:16:13,569 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:16:13,569 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:16:13,569 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:16:13,569 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:16:13,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:16:13,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 21:16:13,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:13,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:13,618 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:16:13,618 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:16:13,618 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:16:13,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:16:13,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 21:16:13,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:13,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:13,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:16:13,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:16:13,627 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~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2019-11-15 21:16:13,627 INFO L793 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2019-11-15 21:16:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 21:16:13,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:13,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692208222] [2019-11-15 21:16:13,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,749 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-11-15 21:16:13,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:13,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527263923] [2019-11-15 21:16:13,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-11-15 21:16:13,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:13,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552924935] [2019-11-15 21:16:13,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:13,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:13,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:14,044 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 21:16:14,117 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:16:14,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:16:14,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:16:14,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:16:14,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:16:14,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:16:14,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:16:14,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:16:14,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2019-11-15 21:16:14,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:16:14,121 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:16:14,159 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 21:16:14,167 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 21:16:14,171 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 21:16:14,175 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 21:16:14,182 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 21:16:14,314 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-15 21:16:14,356 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 21:16:14,360 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 21:16:14,364 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 21:16:14,369 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 21:16:14,375 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 21:16:14,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:16:14,383 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 21:16:14,387 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 21:16:14,390 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 21:16:14,393 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 21:16:14,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:14,764 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:14,767 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 21:16:14,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:14,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:14,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:14,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,789 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 21:16:14,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:14,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:14,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:14,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,796 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 21:16:14,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:14,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,807 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:14,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:14,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,814 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 21:16:14,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:14,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:14,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:14,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,824 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 21:16:14,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:14,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:14,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:14,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,833 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 21:16:14,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,836 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:16:14,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,846 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:16:14,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:14,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,900 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 21:16:14,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:14,909 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:14,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:14,951 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 21:16:14,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:14,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:14,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:14,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:14,958 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:14,965 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:15,083 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:15,129 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:16:15,136 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:16:15,139 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:15,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:16:15,141 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:15,142 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-11-15 21:16:15,160 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:16:15,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:16:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:15,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:15,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:15,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:15,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:15,259 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 21:16:15,275 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 21:16:15,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2019-11-15 21:16:15,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-11-15 21:16:15,374 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 21:16:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:16:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-11-15 21:16:15,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:16:15,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:15,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 21:16:15,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:15,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:16:15,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:15,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-11-15 21:16:15,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:15,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-15 21:16:15,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:16:15,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:16:15,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 21:16:15,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:16:15,399 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 21:16:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 21:16:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 21:16:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:16:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 21:16:15,433 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 21:16:15,433 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 21:16:15,433 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:16:15,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 21:16:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:15,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:15,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:15,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:15,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:16:15,441 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L551 assume !(main_~length~0 < 1); 138#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 134#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 135#L554-3 assume !(main_~i~0 < main_~length~0); 139#L554-4 main_~j~0 := 0; 127#L561-3 [2019-11-15 21:16:15,442 INFO L793 eck$LassoCheckResult]: Loop: 127#L561-3 assume !!(main_~j~0 < main_~length~0); 128#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 140#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 141#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 127#L561-3 [2019-11-15 21:16:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-11-15 21:16:15,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456915155] [2019-11-15 21:16:15,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:15,554 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 21:16:15,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456915155] [2019-11-15 21:16:15,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:15,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:15,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658294111] [2019-11-15 21:16:15,558 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:16:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-11-15 21:16:15,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472462068] [2019-11-15 21:16:15,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:15,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:15,634 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 21:16:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:15,679 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 21:16:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:15,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 21:16:15,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:15,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-11-15 21:16:15,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:16:15,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:16:15,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-15 21:16:15,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:16:15,683 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 21:16:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-15 21:16:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-15 21:16:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:16:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 21:16:15,686 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 21:16:15,686 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 21:16:15,686 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:16:15,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 21:16:15,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:15,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:15,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:15,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:15,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:16:15,688 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 173#L551 assume !(main_~length~0 < 1); 178#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 169#L556 assume !(main_~val~0 < 0); 170#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 171#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 177#L554-3 assume !(main_~i~0 < main_~length~0); 179#L554-4 main_~j~0 := 0; 167#L561-3 [2019-11-15 21:16:15,688 INFO L793 eck$LassoCheckResult]: Loop: 167#L561-3 assume !!(main_~j~0 < main_~length~0); 168#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 180#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 181#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L561-3 [2019-11-15 21:16:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-11-15 21:16:15,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710820936] [2019-11-15 21:16:15,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,727 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-11-15 21:16:15,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679383446] [2019-11-15 21:16:15,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,750 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-11-15 21:16:15,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:15,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564842708] [2019-11-15 21:16:15,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:15,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:15,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:16,064 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-15 21:16:16,147 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:16:16,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:16:16,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:16:16,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:16:16,148 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:16:16,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:16:16,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:16:16,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:16:16,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration3_Lasso [2019-11-15 21:16:16,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:16:16,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:16:16,153 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 21:16:16,159 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 21:16:16,163 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 21:16:16,332 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-15 21:16:16,381 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 21:16:16,384 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 21:16:16,390 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 21:16:16,399 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 21:16:16,402 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 21:16:16,405 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 21:16:16,409 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 21:16:16,412 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 21:16:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:16:16,420 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 21:16:16,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:16:16,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:16,778 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:16,779 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 21:16:16,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:16,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:16,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:16,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:16,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:16,781 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:16,781 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:16,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:16,782 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 21:16:16,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:16,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:16,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:16,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:16,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:16,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:16,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:16,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:16,785 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 21:16:16,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:16,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:16,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:16,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:16,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:16,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:16,839 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:16,888 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 21:16:16,889 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:16:16,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:16,891 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 21:16:16,891 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:16,891 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 1 >= 0] [2019-11-15 21:16:16,902 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 21:16:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:16,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:16:16,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:17,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:16:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:17,028 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 21:16:17,028 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-15 21:16:17,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-11-15 21:16:17,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 53 transitions. Complement of second has 11 states. [2019-11-15 21:16:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-15 21:16:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:16:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-15 21:16:17,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 21:16:17,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:17,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 21:16:17,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:17,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 21:16:17,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:17,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 21:16:17,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:17,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 52 transitions. [2019-11-15 21:16:17,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 21:16:17,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 21:16:17,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-11-15 21:16:17,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:16:17,231 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-11-15 21:16:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-11-15 21:16:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-15 21:16:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 21:16:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-15 21:16:17,236 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 21:16:17,236 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-15 21:16:17,237 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:16:17,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-11-15 21:16:17,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:17,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:17,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:17,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:17,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:16:17,240 INFO L791 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 338#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 339#L551 assume main_~length~0 < 1;main_~length~0 := 1; 344#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 340#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 341#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 334#L556 assume !(main_~val~0 < 0); 335#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 359#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 356#L554-3 assume !(main_~i~0 < main_~length~0); 355#L554-4 main_~j~0 := 0; 353#L561-3 assume !!(main_~j~0 < main_~length~0); 333#L562-3 [2019-11-15 21:16:17,240 INFO L793 eck$LassoCheckResult]: Loop: 333#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 349#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 333#L562-3 [2019-11-15 21:16:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2113338830, now seen corresponding path program 1 times [2019-11-15 21:16:17,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:17,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728780213] [2019-11-15 21:16:17,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,261 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-11-15 21:16:17,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:17,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720701591] [2019-11-15 21:16:17,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -600913837, now seen corresponding path program 1 times [2019-11-15 21:16:17,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:17,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263302851] [2019-11-15 21:16:17,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:17,301 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:17,555 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-15 21:16:17,637 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:16:17,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:16:17,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:16:17,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:16:17,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:16:17,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:16:17,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:16:17,638 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:16:17,638 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2019-11-15 21:16:17,638 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:16:17,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:16:17,641 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 21:16:17,647 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 21:16:17,653 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 21:16:17,657 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 21:16:17,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:16:17,665 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 21:16:17,667 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 21:16:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:16:17,816 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-15 21:16:17,888 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 21:16:17,890 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 21:16:17,902 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 21:16:17,906 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 21:16:17,908 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 21:16:17,911 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 21:16:18,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:18,226 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:18,226 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 21:16:18,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:18,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:18,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:18,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,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 21:16:18,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,230 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:18,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:18,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:18,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,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 21:16:18,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:18,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:18,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,236 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 21:16:18,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,236 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:18,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:18,239 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:18,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,240 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 21:16:18,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,242 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:18,242 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:18,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,245 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 21:16:18,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:18,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:18,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:18,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:16:18,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:18,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:18,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:18,254 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 21:16:18,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:18,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:18,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:18,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:18,258 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:18,258 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:18,272 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:18,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:16:18,277 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:16:18,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:18,279 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:16:18,279 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:18,279 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-11-15 21:16:18,313 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 21:16:18,318 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:16:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:18,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:16:18,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:18,400 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 21:16:18,400 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 21:16:18,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 21:16:18,427 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-11-15 21:16:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:16:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:16:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:16:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 21:16:18,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:18,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:16:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:18,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 21:16:18,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:18,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-11-15 21:16:18,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:18,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 44 states and 57 transitions. [2019-11-15 21:16:18,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 21:16:18,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 21:16:18,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 57 transitions. [2019-11-15 21:16:18,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:16:18,433 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2019-11-15 21:16:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 57 transitions. [2019-11-15 21:16:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-15 21:16:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 21:16:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-11-15 21:16:18,439 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-15 21:16:18,439 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-15 21:16:18,439 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:16:18,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2019-11-15 21:16:18,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:18,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:18,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:18,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:18,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:16:18,442 INFO L791 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 504#L551 assume main_~length~0 < 1;main_~length~0 := 1; 510#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 505#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 506#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 500#L556 assume !(main_~val~0 < 0); 501#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 502#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 508#L554-3 assume !(main_~i~0 < main_~length~0); 509#L554-4 main_~j~0 := 0; 495#L561-3 assume !!(main_~j~0 < main_~length~0); 496#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 520#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 519#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 497#L561-3 assume !!(main_~j~0 < main_~length~0); 499#L562-3 [2019-11-15 21:16:18,442 INFO L793 eck$LassoCheckResult]: Loop: 499#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 512#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 499#L562-3 [2019-11-15 21:16:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1952579805, now seen corresponding path program 1 times [2019-11-15 21:16:18,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:18,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231560659] [2019-11-15 21:16:18,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:18,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231560659] [2019-11-15 21:16:18,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285085390] [2019-11-15 21:16:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/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 21:16:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:18,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:16:18,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:18,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-15 21:16:18,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289367138] [2019-11-15 21:16:18,721 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:16:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-11-15 21:16:18,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:18,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631701921] [2019-11-15 21:16:18,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:18,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:18,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:16:18,777 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-11-15 21:16:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:18,828 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-11-15 21:16:18,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:18,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2019-11-15 21:16:18,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:18,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 45 transitions. [2019-11-15 21:16:18,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 21:16:18,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 21:16:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-15 21:16:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:16:18,832 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 21:16:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-15 21:16:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-15 21:16:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 21:16:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-15 21:16:18,835 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 21:16:18,836 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-15 21:16:18,836 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:16:18,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-15 21:16:18,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:16:18,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:18,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:18,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:18,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:16:18,838 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 653#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 654#L551 assume !(main_~length~0 < 1); 659#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 655#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 656#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 660#L556 assume !(main_~val~0 < 0); 678#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 677#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 661#L554-3 assume !(main_~i~0 < main_~length~0); 662#L554-4 main_~j~0 := 0; 666#L561-3 assume !!(main_~j~0 < main_~length~0); 675#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 672#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 668#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 647#L561-3 assume !!(main_~j~0 < main_~length~0); 649#L562-3 [2019-11-15 21:16:18,838 INFO L793 eck$LassoCheckResult]: Loop: 649#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 663#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 649#L562-3 [2019-11-15 21:16:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-11-15 21:16:18,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:18,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757055262] [2019-11-15 21:16:18,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:18,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:18,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757055262] [2019-11-15 21:16:18,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494947768] [2019-11-15 21:16:18,946 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d836875-20d0-4bc2-8423-cc05b838b00a/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 21:16:19,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:16:19,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:16:19,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:16:19,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:19,118 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:16:19,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-15 21:16:19,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292563869] [2019-11-15 21:16:19,119 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:16:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-11-15 21:16:19,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:19,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893339762] [2019-11-15 21:16:19,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:19,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:16:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:16:19,168 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-11-15 21:16:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:19,396 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-15 21:16:19,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:16:19,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-11-15 21:16:19,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:19,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-11-15 21:16:19,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:16:19,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:16:19,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-15 21:16:19,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:16:19,399 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 21:16:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-15 21:16:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-15 21:16:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:16:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-15 21:16:19,402 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 21:16:19,403 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-15 21:16:19,403 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:16:19,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-11-15 21:16:19,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:16:19,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:19,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:19,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:19,405 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:16:19,405 INFO L791 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 790#L551 assume !(main_~length~0 < 1); 796#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 791#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 792#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 797#L556 assume !(main_~val~0 < 0); 807#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 794#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 795#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 786#L556 assume !(main_~val~0 < 0); 787#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 788#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 806#L554-3 assume !(main_~i~0 < main_~length~0); 802#L554-4 main_~j~0 := 0; 784#L561-3 assume !!(main_~j~0 < main_~length~0); 785#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 798#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 799#L561-2 [2019-11-15 21:16:19,406 INFO L793 eck$LassoCheckResult]: Loop: 799#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 805#L561-3 assume !!(main_~j~0 < main_~length~0); 803#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 804#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 799#L561-2 [2019-11-15 21:16:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash -983203256, now seen corresponding path program 1 times [2019-11-15 21:16:19,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:19,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159675008] [2019-11-15 21:16:19,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2664470, now seen corresponding path program 3 times [2019-11-15 21:16:19,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:19,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898590845] [2019-11-15 21:16:19,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461475, now seen corresponding path program 3 times [2019-11-15 21:16:19,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:19,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524914296] [2019-11-15 21:16:19,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:19,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:19,459 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:19,757 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-11-15 21:16:19,820 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:16:19,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:16:19,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:16:19,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:16:19,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:16:19,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:16:19,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:16:19,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:16:19,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2019-11-15 21:16:19,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:16:19,821 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:16:19,824 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 21:16:19,834 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 21:16:19,837 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 21:16:19,842 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 21:16:19,845 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 21:16:19,976 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 21:16:19,984 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 21:16:19,987 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 21:16:19,989 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 21:16:19,991 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 21:16:19,994 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 21:16:19,996 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 21:16:19,998 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 21:16:20,001 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 21:16:20,003 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 21:16:20,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:20,286 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:20,286 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 21:16:20,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:20,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,287 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:20,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:20,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,289 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 21:16:20,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:20,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:20,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:20,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:16:20,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,292 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:20,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:20,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:20,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,293 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 21:16:20,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,295 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,298 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 21:16:20,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,301 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,301 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:16:20,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,304 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:16:20,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,306 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:16:20,306 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:16:20,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,314 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,316 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 21:16:20,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,323 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 21:16:20,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:20,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:16:20,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:20,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:20,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:20,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:20,331 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:20,332 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:20,354 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:20,377 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:16:20,378 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:16:20,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:20,379 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:16:20,380 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:20,380 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 21:16:20,401 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:16:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:20,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:20,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:20,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:20,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:20,488 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 21:16:20,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:16:20,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 21:16:20,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-11-15 21:16:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:16:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:16:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 21:16:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-15 21:16:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 22 letters. Loop has 4 letters. [2019-11-15 21:16:20,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:20,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 8 letters. [2019-11-15 21:16:20,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:20,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-11-15 21:16:20,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:16:20,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 36 transitions. [2019-11-15 21:16:20,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:16:20,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:16:20,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-15 21:16:20,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:16:20,520 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-15 21:16:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-15 21:16:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 21:16:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:16:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 21:16:20,523 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 21:16:20,523 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 21:16:20,523 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:16:20,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-15 21:16:20,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:16:20,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:16:20,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:16:20,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:20,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:16:20,525 INFO L791 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 949#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 950#L551 assume !(main_~length~0 < 1); 955#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 951#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 952#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 956#L556 assume !(main_~val~0 < 0); 969#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 968#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 957#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 946#L556 assume !(main_~val~0 < 0); 947#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 948#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 954#L554-3 assume !(main_~i~0 < main_~length~0); 962#L554-4 main_~j~0 := 0; 942#L561-3 assume !!(main_~j~0 < main_~length~0); 943#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 963#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 964#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 944#L561-3 assume !!(main_~j~0 < main_~length~0); 945#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 958#L562-1 [2019-11-15 21:16:20,525 INFO L793 eck$LassoCheckResult]: Loop: 958#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 959#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 958#L562-1 [2019-11-15 21:16:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1068815382, now seen corresponding path program 4 times [2019-11-15 21:16:20,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:20,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548291618] [2019-11-15 21:16:20,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2652, now seen corresponding path program 4 times [2019-11-15 21:16:20,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:20,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267122103] [2019-11-15 21:16:20,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 634400049, now seen corresponding path program 1 times [2019-11-15 21:16:20,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:20,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927303338] [2019-11-15 21:16:20,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:16:20,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:16:20,966 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2019-11-15 21:16:21,042 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:16:21,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:16:21,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:16:21,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:16:21,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:16:21,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:16:21,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:16:21,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:16:21,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration8_Lasso [2019-11-15 21:16:21,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:16:21,043 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:16:21,046 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 21:16:21,047 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 21:16:21,050 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 21:16:21,058 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 21:16:21,060 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 21:16:21,213 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 21:16:21,221 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 21:16:21,224 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 21:16:21,227 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 21:16:21,229 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 21:16:21,232 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 21:16:21,235 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 21:16:21,238 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 21:16:21,501 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:21,501 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:21,501 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 21:16:21,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:21,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:21,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:21,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,504 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 21:16:21,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:21,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,504 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:21,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:21,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,506 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 21:16:21,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,508 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,508 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,509 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 21:16:21,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:21,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:21,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:21,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,512 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 21:16:21,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,515 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 21:16:21,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,517 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,517 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,525 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 21:16:21,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,529 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 21:16:21,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,530 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,532 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 21:16:21,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,535 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 21:16:21,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,538 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,542 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 21:16:21,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,542 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:16:21,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,544 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:16:21,544 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:21,549 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 21:16:21,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:21,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:21,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:21,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:21,551 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:21,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:21,559 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:21,564 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:16:21,565 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:16:21,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:21,566 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 21:16:21,566 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:21,567 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = 1*ULTIMATE.start_main_#t~mem7 Supporting invariants [1*ULTIMATE.start_main_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))_1 >= 0] [2019-11-15 21:16:21,580 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 21:16:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 21:16:21,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:21,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 21:16:21,723 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 21:16:21,724 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 21:16:21,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:16:21,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-11-15 21:16:21,767 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 21:16:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:16:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 21:16:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 21:16:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:21,769 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:16:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 21:16:21,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:21,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 21:16:21,854 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 21:16:21,855 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:16:21,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:16:21,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-11-15 21:16:21,896 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 21:16:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:16:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 21:16:21,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 21:16:21,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:21,897 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:16:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-11-15 21:16:21,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:21,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:21,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-11-15 21:16:21,971 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 21:16:21,972 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:16:21,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:16:22,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 4 states. [2019-11-15 21:16:22,003 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 21:16:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:16:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-11-15 21:16:22,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 21:16:22,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:22,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-15 21:16:22,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:22,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-15 21:16:22,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:22,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-11-15 21:16:22,006 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:16:22,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-11-15 21:16:22,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:16:22,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:16:22,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:16:22,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:16:22,007 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:22,007 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:22,007 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:22,007 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:16:22,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:16:22,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:16:22,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:16:22,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:16:22 BoogieIcfgContainer [2019-11-15 21:16:22,013 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:16:22,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:16:22,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:16:22,014 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:16:22,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:16:13" (3/4) ... [2019-11-15 21:16:22,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:16:22,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:16:22,020 INFO L168 Benchmark]: Toolchain (without parser) took 9666.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -87.3 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:22,021 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:22,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:22,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:22,023 INFO L168 Benchmark]: Boogie Preprocessor took 32.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:22,023 INFO L168 Benchmark]: RCFGBuilder took 416.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:22,024 INFO L168 Benchmark]: BuchiAutomizer took 8514.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:22,025 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:22,028 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8514.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -2 * j + 1 and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5f24b515 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 6.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 236 SDslu, 113 SDs, 0 SdLazy, 219 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax113 hnf98 lsp83 ukn77 mio100 lsp56 div100 bol100 ite100 ukn100 eq162 hnf90 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...