./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i -s /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/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 32bit --witnessprinter.graph.data.programhash 5375af47d6130a7bd98a5147355b5bb76e636a73 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:55:14,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:14,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:14,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:14,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:14,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:14,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:14,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:14,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:14,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:14,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:14,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:14,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:14,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:14,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:14,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:14,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:14,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:14,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:14,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:14,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:14,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:14,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:14,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:14,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:14,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:14,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:14,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:14,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:14,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:14,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:14,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:14,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:14,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:14,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:14,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:14,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:14,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:14,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:14,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:14,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:14,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:55:14,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:14,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:14,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:14,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:14,373 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:14,373 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:55:14,373 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:55:14,374 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:55:14,374 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:55:14,374 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:55:14,374 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:55:14,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:14,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:14,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:55:14,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:14,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:14,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:14,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:55:14,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:55:14,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:55:14,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:14,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:14,378 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:55:14,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:14,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:55:14,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:14,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:14,379 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:55:14,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:14,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:14,380 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:55:14,381 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:55:14,382 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_51751a0d-290d-4c98-bfc9-12b975b5c698/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5375af47d6130a7bd98a5147355b5bb76e636a73 [2019-11-15 23:55:14,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:14,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:14,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:14,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:14,432 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:14,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2019-11-15 23:55:14,483 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/data/3d3a725aa/69bdc84c1fcc46ec8866cd6bc9225cee/FLAGf3dbfab4c [2019-11-15 23:55:14,850 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:14,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2019-11-15 23:55:14,856 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/data/3d3a725aa/69bdc84c1fcc46ec8866cd6bc9225cee/FLAGf3dbfab4c [2019-11-15 23:55:14,868 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/data/3d3a725aa/69bdc84c1fcc46ec8866cd6bc9225cee [2019-11-15 23:55:14,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:14,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:14,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:14,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:14,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:14,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:14" (1/1) ... [2019-11-15 23:55:14,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201d2f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:14, skipping insertion in model container [2019-11-15 23:55:14,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:14" (1/1) ... [2019-11-15 23:55:14,885 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:14,899 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:15,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:15,158 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:15,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:15,212 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:15,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15 WrapperNode [2019-11-15 23:55:15,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:15,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:15,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:15,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:15,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:15,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:15,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:15,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:15,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... [2019-11-15 23:55:15,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:15,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:15,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:15,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:15,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:55:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:55:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:55:15,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:55:15,725 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:15,725 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:55:15,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:15 BoogieIcfgContainer [2019-11-15 23:55:15,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:15,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:55:15,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:55:15,730 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:55:15,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:15,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:55:14" (1/3) ... [2019-11-15 23:55:15,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77136712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:55:15, skipping insertion in model container [2019-11-15 23:55:15,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:15,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:15" (2/3) ... [2019-11-15 23:55:15,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77136712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:55:15, skipping insertion in model container [2019-11-15 23:55:15,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:15,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:15" (3/3) ... [2019-11-15 23:55:15,736 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_single_elem_init.i [2019-11-15 23:55:15,784 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:55:15,784 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:55:15,784 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:55:15,784 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:15,785 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:15,785 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:55:15,785 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:15,785 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:55:15,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 23:55:15,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 23:55:15,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:15,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:15,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:55:15,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:15,828 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:55:15,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-11-15 23:55:15,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 23:55:15,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:15,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:15,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:55:15,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:15,839 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 5#L10-3true [2019-11-15 23:55:15,840 INFO L793 eck$LassoCheckResult]: Loop: 5#L10-3true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 21#L14true assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); 16#L14-2true call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 9#L19true assume !(0 != main_#t~mem2);havoc main_#t~mem2; 8#L10-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 5#L10-3true [2019-11-15 23:55:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:55:15,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753210395] [2019-11-15 23:55:15,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:15,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2019-11-15 23:55:15,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169376987] [2019-11-15 23:55:15,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2019-11-15 23:55:16,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062441958] [2019-11-15 23:55:16,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:16,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062441958] [2019-11-15 23:55:16,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:16,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:16,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863520388] [2019-11-15 23:55:16,353 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 23:55:16,509 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-15 23:55:16,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:16,529 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-11-15 23:55:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,659 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-11-15 23:55:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:16,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-11-15 23:55:16,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-11-15 23:55:16,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-11-15 23:55:16,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:55:16,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 23:55:16,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-11-15 23:55:16,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:16,670 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-15 23:55:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-11-15 23:55:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-15 23:55:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:55:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 23:55:16,697 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:55:16,697 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:55:16,697 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:55:16,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 23:55:16,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 23:55:16,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:16,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:16,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:55:16,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:16,699 INFO L791 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 61#L10-3 [2019-11-15 23:55:16,699 INFO L793 eck$LassoCheckResult]: Loop: 61#L10-3 assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 62#L14 assume !(0 == main_~q~0); 71#L14-2 call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 72#L19 assume !(0 != main_#t~mem2);havoc main_#t~mem2; 64#L10-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 61#L10-3 [2019-11-15 23:55:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 23:55:16,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274196993] [2019-11-15 23:55:16,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2019-11-15 23:55:16,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007752689] [2019-11-15 23:55:16,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2019-11-15 23:55:16,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672905923] [2019-11-15 23:55:16,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:16,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:17,022 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:55:17,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:55:17,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:55:17,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:55:17,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:55:17,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:17,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:55:17,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:55:17,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration2_Lasso [2019-11-15 23:55:17,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:55:17,024 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:55:17,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,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 23:55:17,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:17,631 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 23:55:17,661 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:55:17,665 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:55:17,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:17,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:17,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,681 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:55:17,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,686 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:55:17,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,707 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:17,707 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:17,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,739 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,739 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,749 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,749 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,771 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:17,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:17,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:17,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,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 23:55:17,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,792 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,792 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,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 23:55:17,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,798 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,798 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:17,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:17,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:17,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:17,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:17,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:17,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:17,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:17,843 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:55:17,908 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:55:17,908 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:55:17,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:55:17,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:55:17,913 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:55:17,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-11-15 23:55:17,936 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:55:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:17,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:17,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:17,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:55:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:55:18,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 23:55:18,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 36 transitions. Complement of second has 7 states. [2019-11-15 23:55:18,070 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 23:55:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:55:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 23:55:18,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 23:55:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 23:55:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 23:55:18,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-11-15 23:55:18,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:55:18,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2019-11-15 23:55:18,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:55:18,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:55:18,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-15 23:55:18,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:18,079 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 23:55:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-15 23:55:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 23:55:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:55:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 23:55:18,082 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 23:55:18,082 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 23:55:18,083 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:55:18,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 23:55:18,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:55:18,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:18,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:18,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:55:18,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:55:18,085 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 171#L10-3 assume !(main_~i~0 < 100000); 169#L10-4 call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; 170#L32-3 [2019-11-15 23:55:18,085 INFO L793 eck$LassoCheckResult]: Loop: 170#L32-3 assume !!(main_~i~0 < 100000); 174#L34 assume !(15000 == main_~i~0); 178#L32-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 170#L32-3 [2019-11-15 23:55:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2019-11-15 23:55:18,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:18,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419933939] [2019-11-15 23:55:18,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419933939] [2019-11-15 23:55:18,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:18,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:18,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381031615] [2019-11-15 23:55:18,109 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:55:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2019-11-15 23:55:18,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:18,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685294749] [2019-11-15 23:55:18,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:18,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:18,134 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:55:18,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:55:18,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:55:18,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:55:18,135 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:55:18,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:18,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:55:18,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:55:18,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration3_Loop [2019-11-15 23:55:18,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:55:18,136 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:55:18,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:18,217 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:55:18,218 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:18,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:55:18,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:55:18,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:55:18,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:18,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:55:18,261 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51751a0d-290d-4c98-bfc9-12b975b5c698/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:18,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:55:18,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:55:18,409 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:55:18,412 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:55:18,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:55:18,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:55:18,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:55:18,412 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:55:18,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:18,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:55:18,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:55:18,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration3_Loop [2019-11-15 23:55:18,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:55:18,413 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:55:18,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:18,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:18,531 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:55:18,532 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:55:18,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 23:55:18,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:18,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:18,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:18,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:18,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:18,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:18,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:18,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:18,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 23:55:18,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:18,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:18,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:18,535 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:55:18,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:18,536 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:55:18,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:18,548 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:55:18,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:55:18,553 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:55:18,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:55:18,562 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:55:18,563 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:55:18,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-11-15 23:55:18,563 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:55:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:18,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:55:18,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,605 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:55:18,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 23:55:18,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2019-11-15 23:55:18,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:55:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:55:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-15 23:55:18,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 23:55:18,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:55:18,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 23:55:18,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:18,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-11-15 23:55:18,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:55:18,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-11-15 23:55:18,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:55:18,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:55:18,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:55:18,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:18,624 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:18,624 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:18,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:18,625 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 23:55:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:18,625 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:55:18,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:55:18,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:55:18,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:55:18,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:55:18,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:55:18,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:55:18,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:55:18,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:18,626 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:18,626 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:18,626 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:55:18,626 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:55:18,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:55:18,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:55:18,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:55:18,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:55:18 BoogieIcfgContainer [2019-11-15 23:55:18,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:55:18,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:55:18,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:55:18,633 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:55:18,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:15" (3/4) ... [2019-11-15 23:55:18,637 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:55:18,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:55:18,639 INFO L168 Benchmark]: Toolchain (without parser) took 3766.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:18,639 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:18,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:18,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:18,641 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:18,641 INFO L168 Benchmark]: RCFGBuilder took 450.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:18,642 INFO L168 Benchmark]: BuchiAutomizer took 2905.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:18,642 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:18,646 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2905.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 58 SDslu, 29 SDs, 0 SdLazy, 62 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp95 ukn85 mio100 lsp81 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf233 smp89 tf104 neg91 sie131 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...