./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array01-alloca-2.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_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array01-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/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 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:24:12,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:24:12,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:24:12,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:24:12,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:24:12,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:24:12,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:24:12,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:24:12,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:24:12,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:24:12,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:24:12,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:24:12,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:24:12,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:24:12,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:24:12,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:24:12,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:24:12,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:24:12,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:24:12,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:24:12,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:24:12,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:24:12,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:24:12,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:24:12,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:24:12,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:24:12,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:24:12,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:24:12,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:24:12,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:24:12,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:24:12,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:24:12,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:24:12,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:24:12,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:24:12,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:24:12,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:24:12,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:24:12,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:24:12,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:24:12,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:24:12,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:24:12,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:24:12,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:24:12,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:24:12,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:24:12,609 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:24:12,609 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:24:12,610 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:24:12,610 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:24:12,610 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:24:12,610 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:24:12,611 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:24:12,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:24:12,611 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:24:12,611 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:24:12,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:24:12,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:24:12,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:24:12,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:24:12,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:24:12,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:24:12,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:24:12,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:24:12,614 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:24:12,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:24:12,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:24:12,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:24:12,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:24:12,616 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:24:12,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:24:12,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:24:12,617 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:24:12,618 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:24:12,619 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_41067414-13c6-4995-a18e-65939b7eeb13/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 -> 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 [2019-11-15 22:24:12,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:24:12,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:24:12,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:24:12,679 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:24:12,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:24:12,680 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2019-11-15 22:24:12,750 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/data/6e1170c55/3ae1b42a3ff24d17b934fb853c91697f/FLAG07ad5a881 [2019-11-15 22:24:13,178 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:24:13,179 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2019-11-15 22:24:13,191 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/data/6e1170c55/3ae1b42a3ff24d17b934fb853c91697f/FLAG07ad5a881 [2019-11-15 22:24:13,559 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/bin/uautomizer/data/6e1170c55/3ae1b42a3ff24d17b934fb853c91697f [2019-11-15 22:24:13,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:24:13,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:24:13,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:13,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:24:13,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:24:13,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:13" (1/1) ... [2019-11-15 22:24:13,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:13, skipping insertion in model container [2019-11-15 22:24:13,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:13" (1/1) ... [2019-11-15 22:24:13,578 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:24:13,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:24:13,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:13,962 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:24:14,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:14,069 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:24:14,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14 WrapperNode [2019-11-15 22:24:14,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:14,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:14,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:24:14,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:24:14,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:14,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:24:14,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:24:14,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:24:14,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... [2019-11-15 22:24:14,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:24:14,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:24:14,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:24:14,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:24:14,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/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 22:24:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:24:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:24:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:24:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:24:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:24:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:24:14,691 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:24:14,691 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:24:14,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:14 BoogieIcfgContainer [2019-11-15 22:24:14,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:24:14,693 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:24:14,693 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:24:14,698 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:24:14,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:14,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:24:13" (1/3) ... [2019-11-15 22:24:14,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e190ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:24:14, skipping insertion in model container [2019-11-15 22:24:14,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:14,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:14" (2/3) ... [2019-11-15 22:24:14,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e190ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:24:14, skipping insertion in model container [2019-11-15 22:24:14,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:24:14,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:14" (3/3) ... [2019-11-15 22:24:14,708 INFO L371 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2019-11-15 22:24:14,779 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:24:14,780 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:24:14,780 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:24:14,780 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:24:14,780 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:24:14,780 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:24:14,780 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:24:14,780 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:24:14,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:24:14,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:24:14,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:14,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:14,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:24:14,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:24:14,838 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:24:14,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:24:14,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:24:14,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:14,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:14,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:24:14,843 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:24:14,851 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L526true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L526-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 16#L531-3true [2019-11-15 22:24:14,852 INFO L793 eck$LassoCheckResult]: Loop: 16#L531-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 15#L531-2true main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 16#L531-3true [2019-11-15 22:24:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 22:24:14,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:14,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636895584] [2019-11-15 22:24:14,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:14,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:15,019 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 22:24:15,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:15,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794495725] [2019-11-15 22:24:15,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:15,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:15,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:15,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 22:24:15,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:15,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758661151] [2019-11-15 22:24:15,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:15,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:15,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:15,075 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:15,295 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:24:15,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:24:15,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:24:15,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:24:15,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:24:15,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:15,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:24:15,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:24:15,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2019-11-15 22:24:15,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:24:15,297 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:24:15,319 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 22:24:15,325 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 22:24:15,328 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 22:24:15,332 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 22:24:15,335 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 22:24:15,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:15,469 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 22:24:15,474 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 22:24:15,478 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 22:24:15,483 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 22:24:15,831 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:24:15,840 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:24:15,842 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 22:24:15,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:15,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:15,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:15,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,852 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 22:24:15,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:15,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:15,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:15,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,856 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 22:24:15,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,861 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:15,861 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:15,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,867 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 22:24:15,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,877 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:15,878 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:15,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,893 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 22:24:15,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,896 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:15,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:15,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,907 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 22:24:15,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:15,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,911 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:15,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:15,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:15,916 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 22:24:15,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:15,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:15,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:15,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:15,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:15,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:16,056 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:24:16,122 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:24:16,122 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:24:16,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:24:16,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:24:16,127 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:24:16,128 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-11-15 22:24:16,138 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:24:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:16,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:16,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:16,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:24:16,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:16,211 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 22:24:16,229 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 22:24:16,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 22:24:16,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-11-15 22:24:16,310 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 22:24:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-15 22:24:16,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:24:16,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:16,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:24:16,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:16,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 22:24:16,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:16,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-15 22:24:16,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:24:16,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-11-15 22:24:16,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:24:16,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:24:16,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 22:24:16,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:24:16,340 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:24:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 22:24:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 22:24:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 22:24:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 22:24:16,372 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:24:16,372 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:24:16,372 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:24:16,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 22:24:16,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:24:16,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:16,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:16,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:24:16,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:24:16,378 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 115#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 116#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 119#L531-3 assume !(main_~k~0 < main_~array_size~0); 122#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 118#L516-3 [2019-11-15 22:24:16,378 INFO L793 eck$LassoCheckResult]: Loop: 118#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 111#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 112#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 118#L516-3 [2019-11-15 22:24:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 22:24:16,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:16,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734433328] [2019-11-15 22:24:16,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:16,491 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 22:24:16,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734433328] [2019-11-15 22:24:16,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:24:16,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:24:16,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765139081] [2019-11-15 22:24:16,495 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:24:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2019-11-15 22:24:16,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:16,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334017628] [2019-11-15 22:24:16,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:16,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:16,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:24:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:24:16,578 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 22:24:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:16,618 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-15 22:24:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:24:16,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 22:24:16,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:24:16,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-11-15 22:24:16,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:24:16,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:24:16,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-15 22:24:16,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:24:16,623 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 22:24:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-15 22:24:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 22:24:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 22:24:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 22:24:16,625 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 22:24:16,625 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 22:24:16,626 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:24:16,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 22:24:16,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:24:16,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:16,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:16,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:16,627 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:24:16,628 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 144#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 148#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 151#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 152#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 153#L531-3 assume !(main_~k~0 < main_~array_size~0); 154#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 150#L516-3 [2019-11-15 22:24:16,628 INFO L793 eck$LassoCheckResult]: Loop: 150#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 147#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 145#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 146#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 150#L516-3 [2019-11-15 22:24:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-15 22:24:16,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:16,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123606907] [2019-11-15 22:24:16,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2019-11-15 22:24:16,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:16,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577658601] [2019-11-15 22:24:16,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2019-11-15 22:24:16,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:16,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045623985] [2019-11-15 22:24:16,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:16,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:16,992 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-15 22:24:17,088 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:24:17,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:24:17,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:24:17,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:24:17,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:24:17,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:17,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:24:17,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:24:17,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration3_Lasso [2019-11-15 22:24:17,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:24:17,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:24:17,094 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 22:24:17,285 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 22:24:17,338 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 22:24:17,339 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 22:24:17,345 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 22:24:17,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:17,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:17,355 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 22:24:17,358 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 22:24:17,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 22:24:17,362 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 22:24:17,365 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 22:24:17,367 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 22:24:17,378 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 22:24:17,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 22:24:17,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 22:24:17,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 22:24:17,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 22:24:17,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 22:24:17,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:24:17,725 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:24:17,725 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 22:24:17,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:17,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:17,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:17,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:17,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:17,728 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:17,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:17,731 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 22:24:17,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:17,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:17,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:17,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:17,734 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:17,734 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:17,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:17,742 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 22:24:17,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:17,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:17,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:17,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:17,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:17,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:17,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:17,747 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 22:24:17,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:17,748 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:24:17,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:17,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:17,751 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:24:17,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:17,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:17,763 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 22:24:17,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:17,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:17,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:17,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:17,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:17,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:17,796 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:24:17,815 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:24:17,815 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:24:17,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:24:17,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:24:17,818 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:24:17,818 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-11-15 22:24:17,831 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:24:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:17,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:17,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:17,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:24:17,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:17,891 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 22:24:17,892 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 22:24:17,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:24:17,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2019-11-15 22:24:17,909 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 22:24:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 22:24:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 22:24:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 22:24:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:17,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-15 22:24:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:17,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-15 22:24:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:17,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2019-11-15 22:24:17,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:24:17,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:24:17,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-15 22:24:17,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:24:17,913 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 22:24:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-15 22:24:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 22:24:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:24:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 22:24:17,915 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:24:17,915 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:24:17,916 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:24:17,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 22:24:17,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:17,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:17,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:17,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:17,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:24:17,917 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 250#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 251#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 254#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 255#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 256#L531-3 assume !(main_~k~0 < main_~array_size~0); 258#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 257#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 245#L517-3 [2019-11-15 22:24:17,918 INFO L793 eck$LassoCheckResult]: Loop: 245#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 244#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 245#L517-3 [2019-11-15 22:24:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-11-15 22:24:17,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:17,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990185124] [2019-11-15 22:24:17,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:17,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:17,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:17,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-11-15 22:24:17,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:17,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439204308] [2019-11-15 22:24:17,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:17,965 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-11-15 22:24:17,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:17,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097428933] [2019-11-15 22:24:17,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:18,011 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:18,285 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-15 22:24:18,378 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:24:18,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:24:18,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:24:18,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:24:18,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:24:18,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:18,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:24:18,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:24:18,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2019-11-15 22:24:18,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:24:18,379 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:24:18,382 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 22:24:18,388 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 22:24:18,391 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 22:24:18,396 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 22:24:18,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 22:24:18,401 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 22:24:18,404 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 22:24:18,408 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 22:24:18,410 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 22:24:18,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 22:24:18,415 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 22:24:18,422 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 22:24:18,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 22:24:18,587 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-15 22:24:18,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:18,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 22:24:18,658 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 22:24:18,666 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 22:24:18,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:24:19,032 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:24:19,032 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:24:19,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:24:19,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,035 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 22:24:19,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,037 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:19,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,039 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 22:24:19,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,041 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:19,041 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,047 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 22:24:19,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,050 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 22:24:19,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,053 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 22:24:19,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,055 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:19,055 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,058 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 22:24:19,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,060 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,060 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 22:24:19,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,062 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,062 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,063 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 22:24:19,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,065 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 22:24:19,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,067 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,068 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 22:24:19,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:19,070 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,072 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 22:24:19,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:19,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:19,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:19,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,074 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 22:24:19,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,075 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:24:19,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,077 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:24:19,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:19,086 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 22:24:19,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:19,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:19,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:19,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:19,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:19,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:19,096 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:24:19,100 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:24:19,100 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:24:19,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:24:19,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:24:19,101 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:24:19,102 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-15 22:24:19,120 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:24:19,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:24:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:19,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:19,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:19,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:24:19,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:19,177 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 22:24:19,178 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 22:24:19,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:24:19,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 7 states. [2019-11-15 22:24:19,199 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 22:24:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 22:24:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:24:19,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:19,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 22:24:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:19,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 22:24:19,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:19,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-11-15 22:24:19,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:19,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2019-11-15 22:24:19,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:24:19,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:24:19,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-15 22:24:19,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:24:19,204 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:24:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-15 22:24:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 22:24:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:24:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-15 22:24:19,206 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 22:24:19,206 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 22:24:19,206 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:24:19,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-15 22:24:19,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:19,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:19,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:19,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:19,208 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:24:19,208 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 368#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 369#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 370#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 376#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 378#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 379#L531-3 assume !(main_~k~0 < main_~array_size~0); 380#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 377#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 367#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 381#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 372#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 373#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 365#L517-3 [2019-11-15 22:24:19,208 INFO L793 eck$LassoCheckResult]: Loop: 365#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 364#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 365#L517-3 [2019-11-15 22:24:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2019-11-15 22:24:19,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:19,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401627021] [2019-11-15 22:24:19,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:19,284 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 22:24:19,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401627021] [2019-11-15 22:24:19,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321751133] [2019-11-15 22:24:19,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41067414-13c6-4995-a18e-65939b7eeb13/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 22:24:19,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:24:19,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:19,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:24:19,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:19,472 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 22:24:19,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:19,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-11-15 22:24:19,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578890757] [2019-11-15 22:24:19,473 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:24:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-11-15 22:24:19,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:19,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729558149] [2019-11-15 22:24:19,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:19,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:24:19,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:24:19,517 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-15 22:24:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:19,676 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-15 22:24:19,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:24:19,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-15 22:24:19,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:19,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 25 transitions. [2019-11-15 22:24:19,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:24:19,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:24:19,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-11-15 22:24:19,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:24:19,679 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 22:24:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-11-15 22:24:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 22:24:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:24:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-15 22:24:19,682 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-15 22:24:19,682 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-15 22:24:19,682 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:24:19,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-11-15 22:24:19,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:24:19,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:24:19,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:24:19,683 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:24:19,683 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:24:19,684 INFO L791 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 479#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 480#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 486#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 490#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 491#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 487#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 488#L531-3 assume !(main_~k~0 < main_~array_size~0); 492#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 489#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 477#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 493#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 484#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 485#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 475#L517-3 [2019-11-15 22:24:19,684 INFO L793 eck$LassoCheckResult]: Loop: 475#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 474#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 475#L517-3 [2019-11-15 22:24:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2019-11-15 22:24:19,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:19,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520189933] [2019-11-15 22:24:19,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-11-15 22:24:19,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:19,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643917052] [2019-11-15 22:24:19,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2019-11-15 22:24:19,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:19,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4427895] [2019-11-15 22:24:19,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:19,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:24:19,789 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:24:20,212 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2019-11-15 22:24:20,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:24:20,309 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:24:20,309 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:24:20,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:24:20,310 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:24:20,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:24:20,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:24:20,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:24:20,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration6_Lasso [2019-11-15 22:24:20,310 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:24:20,310 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:24:20,313 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 22:24:20,318 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 22:24:20,321 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 22:24:20,325 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 22:24:20,327 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 22:24:20,335 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 22:24:20,342 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 22:24:20,345 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 22:24:20,347 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 22:24:20,349 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 22:24:20,351 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 22:24:20,353 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 22:24:20,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 22:24:20,358 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 22:24:20,504 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-15 22:24:20,525 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 22:24:20,527 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 22:24:20,529 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 22:24:20,530 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 22:24:20,709 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-11-15 22:24:20,920 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:24:20,921 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:24:20,921 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 22:24:20,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,928 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 22:24:20,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,930 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,930 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,932 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 22:24:20,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,933 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,938 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 22:24:20,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,939 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,939 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,940 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 22:24:20,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,942 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,942 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,944 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 22:24:20,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,946 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 22:24:20,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,948 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,948 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,949 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 22:24:20,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,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 22:24:20,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,954 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 22:24:20,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,958 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 22:24:20,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,961 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 22:24:20,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,963 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,963 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,964 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 22:24:20,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,967 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 22:24:20,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,968 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:24:20,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,970 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:24:20,970 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,976 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 22:24:20,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:24:20,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:24:20,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:24:20,990 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 22:24:20,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:24:20,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:24:20,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:24:20,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:24:20,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:24:20,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:24:20,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:24:20,993 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:24:20,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:24:20,994 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:24:20,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:24:20,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:24:20,995 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:24:20,995 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-11-15 22:24:21,010 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:24:21,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:24:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,065 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 22:24:21,066 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 22:24:21,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:24:21,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2019-11-15 22:24:21,079 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 22:24:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 22:24:21,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 22:24:21,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:21,080 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:24:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,156 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 22:24:21,156 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 22:24:21,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:24:21,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2019-11-15 22:24:21,169 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 22:24:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 22:24:21,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 22:24:21,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:21,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:24:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:21,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:24:21,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,223 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 22:24:21,223 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 22:24:21,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 22:24:21,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 32 transitions. Complement of second has 6 states. [2019-11-15 22:24:21,242 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 22:24:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:24:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 22:24:21,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 22:24:21,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:21,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 22:24:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 22:24:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:24:21,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-15 22:24:21,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:24:21,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:24:21,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:24:21,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:24:21,246 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:24:21,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:24:21,246 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:24:21,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:24:21,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:24:21 BoogieIcfgContainer [2019-11-15 22:24:21,253 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:24:21,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:24:21,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:24:21,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:24:21,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:14" (3/4) ... [2019-11-15 22:24:21,258 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:24:21,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:24:21,260 INFO L168 Benchmark]: Toolchain (without parser) took 7697.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -219.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:24:21,260 INFO L168 Benchmark]: CDTParser took 0.26 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 22:24:21,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:21,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.37 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 22:24:21,262 INFO L168 Benchmark]: Boogie Preprocessor took 51.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:21,263 INFO L168 Benchmark]: RCFGBuilder took 505.27 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:24:21,264 INFO L168 Benchmark]: BuchiAutomizer took 6560.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -63.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:24:21,264 INFO L168 Benchmark]: Witness Printer took 4.74 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 22:24:21,267 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.26 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 508.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.37 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 51.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 505.27 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6560.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -63.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.74 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * k + array_size and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 101 SDslu, 81 SDs, 0 SdLazy, 144 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax112 hnf99 lsp82 ukn84 mio100 lsp60 div100 bol100 ite100 ukn100 eq176 hnf90 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 5 VariablesLoop: 3 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...