./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i -s /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a96be28be4b50f026536d78db5ba85eeb0ae4413 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:36,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:36,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:36,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:36,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:36,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:36,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:36,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:36,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:36,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:36,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:36,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:36,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:37,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:37,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:37,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:37,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:37,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:37,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:37,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:37,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:37,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:37,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:37,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:37,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:37,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:37,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:37,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:37,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:37,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:37,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:37,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:37,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:37,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:37,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:37,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:37,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:37,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:37,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:37,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:37,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:37,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:37,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:37,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:37,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:37,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:37,041 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:37,041 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:37,041 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:37,041 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:37,042 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:37,042 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:37,042 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:37,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:37,042 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:37,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:37,043 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:37,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:37,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:37,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:37,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:37,044 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:37,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:37,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:37,045 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:37,046 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:37,046 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/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2019-10-22 08:57:37,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:37,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:37,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:37,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:37,099 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:37,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2019-10-22 08:57:37,150 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/data/2c7d580ba/99c3fb580ee74c8a9fe5ce3003d3fc6f/FLAG893d1c49b [2019-10-22 08:57:37,538 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:37,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2019-10-22 08:57:37,543 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/data/2c7d580ba/99c3fb580ee74c8a9fe5ce3003d3fc6f/FLAG893d1c49b [2019-10-22 08:57:37,554 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/bin/uautomizer/data/2c7d580ba/99c3fb580ee74c8a9fe5ce3003d3fc6f [2019-10-22 08:57:37,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:37,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:37,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:37,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:37,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:37,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5616b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37, skipping insertion in model container [2019-10-22 08:57:37,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,574 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:37,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:37,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:37,734 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:37,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:37,823 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:37,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37 WrapperNode [2019-10-22 08:57:37,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:37,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:37,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:37,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:37,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:37,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:37,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:37,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:37,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:37,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:37,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_07aa5e63-b002-4aa2-a25a-5fd0681c6ff3/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-10-22 08:57:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-10-22 08:57:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-10-22 08:57:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:38,231 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:38,231 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:57:38,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38 BoogieIcfgContainer [2019-10-22 08:57:38,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:38,233 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:38,233 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:38,248 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:38,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:38,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:37" (1/3) ... [2019-10-22 08:57:38,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451d1b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:38, skipping insertion in model container [2019-10-22 08:57:38,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:38,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (2/3) ... [2019-10-22 08:57:38,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451d1b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:38, skipping insertion in model container [2019-10-22 08:57:38,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:38,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38" (3/3) ... [2019-10-22 08:57:38,253 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3.i [2019-10-22 08:57:38,342 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:38,342 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:38,342 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:38,343 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:38,343 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:38,343 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:38,343 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:38,343 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:38,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:57:38,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:38,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:38,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:38,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:38,405 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,405 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:38,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:57:38,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:38,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:38,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:38,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:38,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,417 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L20-2true [2019-10-22 08:57:38,417 INFO L793 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 13#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 15#recFINALtrue assume true; 12#recEXITtrue >#30#return; 11#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 5#L20-2true [2019-10-22 08:57:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-10-22 08:57:38,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549320528] [2019-10-22 08:57:38,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2019-10-22 08:57:38,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413182194] [2019-10-22 08:57:38,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,636 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2019-10-22 08:57:38,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246331836] [2019-10-22 08:57:38,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:39,091 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-10-22 08:57:39,174 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:39,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:39,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:39,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:39,176 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:39,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:39,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:39,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:39,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration1_Lasso [2019-10-22 08:57:39,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:39,178 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:39,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:39,469 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:39,474 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:39,476 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-10-22 08:57:39,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,494 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-10-22 08:57:39,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:39,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,515 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,515 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,518 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-10-22 08:57:39,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,521 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-10-22 08:57:39,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,522 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:39,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:39,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,531 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:39,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,532 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:39,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:39,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:39,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:39,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:39,559 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-10-22 08:57:39,560 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:39,560 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:39,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:39,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:39,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:39,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:39,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:39,569 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:39,577 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:39,577 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:39,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:39,581 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:57:39,582 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:39,582 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:57:39,590 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:57:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:39,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:39,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:39,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:39,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:39,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:39,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-10-22 08:57:39,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2019-10-22 08:57:39,921 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 63 states and 77 transitions. Complement of second has 22 states. [2019-10-22 08:57:39,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:57:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2019-10-22 08:57:39,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 08:57:39,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 08:57:39,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 08:57:39,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:39,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2019-10-22 08:57:39,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:57:39,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2019-10-22 08:57:39,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:57:39,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:57:39,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-10-22 08:57:39,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:39,949 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-10-22 08:57:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-10-22 08:57:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-22 08:57:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:57:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-22 08:57:39,980 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:57:39,981 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:57:39,981 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:39,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-10-22 08:57:39,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:57:39,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:39,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:39,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:39,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:39,984 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 162#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 174#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 175#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 185#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 156#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2019-10-22 08:57:39,984 INFO L793 eck$LassoCheckResult]: Loop: 164#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 154#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 155#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2019-10-22 08:57:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2019-10-22 08:57:39,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30377820] [2019-10-22 08:57:39,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,020 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2019-10-22 08:57:40,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067452290] [2019-10-22 08:57:40,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,034 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2019-10-22 08:57:40,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750554492] [2019-10-22 08:57:40,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:40,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:40,612 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-10-22 08:57:40,639 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:40,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:40,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:40,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:40,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:40,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:40,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:40,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:40,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration2_Lasso [2019-10-22 08:57:40,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:40,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:40,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,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-10-22 08:57:40,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,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-10-22 08:57:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,944 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:40,944 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:40,945 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-10-22 08:57:40,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,947 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-10-22 08:57:40,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,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-10-22 08:57:40,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,952 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-10-22 08:57:40,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,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-10-22 08:57:40,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:40,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:40,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,959 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-10-22 08:57:40,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,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-10-22 08:57:40,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,963 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-10-22 08:57:40,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,966 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-10-22 08:57:40,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,966 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,967 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,968 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-10-22 08:57:40,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,969 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,970 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-10-22 08:57:40,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,972 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:40,972 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:40,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,975 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-10-22 08:57:40,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,978 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-10-22 08:57:40,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,979 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,979 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,980 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-10-22 08:57:40,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,982 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-10-22 08:57:40,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,985 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-10-22 08:57:40,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,987 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-10-22 08:57:40,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,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-10-22 08:57:40,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,992 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-10-22 08:57:40,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:40,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:40,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:40,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:40,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:40,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:40,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:40,994 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-10-22 08:57:40,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:40,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:41,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:41,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:41,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,001 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-10-22 08:57:41,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:41,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:41,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:41,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,004 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-10-22 08:57:41,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:41,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:41,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:41,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,006 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-10-22 08:57:41,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:41,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:41,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:41,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,009 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-10-22 08:57:41,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,020 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:41,022 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:41,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,046 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-10-22 08:57:41,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,048 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:41,049 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:41,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:41,056 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-10-22 08:57:41,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:41,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:41,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:41,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:41,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:41,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:41,072 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:41,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:41,077 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:57:41,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:41,079 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:41,079 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:41,079 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-10-22 08:57:41,081 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:57:41,085 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:41,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:41,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:41,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:57:41,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:41,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:41,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:41,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:57:41,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-10-22 08:57:41,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:57:41,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-10-22 08:57:41,255 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 17 states. [2019-10-22 08:57:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-10-22 08:57:41,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:57:41,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:41,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:57:41,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:41,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:57:41,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:41,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-10-22 08:57:41,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:41,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2019-10-22 08:57:41,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:57:41,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:57:41,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2019-10-22 08:57:41,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:41,264 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-10-22 08:57:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2019-10-22 08:57:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 08:57:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:57:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-10-22 08:57:41,269 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-10-22 08:57:41,269 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-10-22 08:57:41,269 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:41,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2019-10-22 08:57:41,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:41,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:41,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:41,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:41,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:41,271 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 311#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 329#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 339#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 338#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 309#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 314#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 315#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 343#recFINAL assume true; 322#recEXIT >#28#return; 323#L15-1 #res := #t~ret5;havoc #t~ret5; 337#recFINAL assume true; 332#recEXIT >#30#return; 318#L23-1 [2019-10-22 08:57:41,271 INFO L793 eck$LassoCheckResult]: Loop: 318#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 319#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 326#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 327#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 334#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 336#recFINAL assume true; 341#recEXIT >#30#return; 318#L23-1 [2019-10-22 08:57:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2019-10-22 08:57:41,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804249728] [2019-10-22 08:57:41,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,320 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2019-10-22 08:57:41,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764305241] [2019-10-22 08:57:41,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2019-10-22 08:57:41,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396434273] [2019-10-22 08:57:41,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:41,392 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:41,591 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-22 08:57:41,991 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-22 08:57:42,051 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:42,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:42,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:42,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:42,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:42,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:42,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:42,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:42,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration3_Lasso [2019-10-22 08:57:42,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:42,052 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:42,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:42,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:42,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:42,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:42,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:42,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:42,363 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:42,363 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-10-22 08:57:42,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,365 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,373 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-10-22 08:57:42,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,374 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,374 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,376 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-10-22 08:57:42,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,377 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:42,377 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:42,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,381 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:57:42,381 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:57:42,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,407 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-10-22 08:57:42,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,413 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-10-22 08:57:42,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,415 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,415 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,418 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-10-22 08:57:42,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,420 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,420 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,432 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:42,456 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:57:42,456 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:57:42,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:42,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:42,458 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:42,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:57:42,475 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:42,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:42,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:42,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:42,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 08:57:42,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-10-22 08:57:42,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 130 states and 152 transitions. Complement of second has 21 states. [2019-10-22 08:57:42,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-10-22 08:57:42,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2019-10-22 08:57:42,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-10-22 08:57:42,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2019-10-22 08:57:42,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2019-10-22 08:57:42,697 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:57:42,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2019-10-22 08:57:42,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-10-22 08:57:42,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-10-22 08:57:42,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2019-10-22 08:57:42,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:42,700 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2019-10-22 08:57:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2019-10-22 08:57:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-10-22 08:57:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 08:57:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-10-22 08:57:42,708 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-10-22 08:57:42,708 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-10-22 08:57:42,708 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:42,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2019-10-22 08:57:42,710 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:57:42,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:42,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:42,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:42,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:42,711 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 604#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 633#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 634#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 639#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 629#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 638#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 644#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 641#recFINAL assume true; 637#recEXIT >#28#return; 636#L15-1 #res := #t~ret5;havoc #t~ret5; 635#recFINAL assume true; 632#recEXIT >#30#return; 631#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 618#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 622#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 623#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 673#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 609#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2019-10-22 08:57:42,711 INFO L793 eck$LassoCheckResult]: Loop: 608#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 611#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 610#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2019-10-22 08:57:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2019-10-22 08:57:42,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369798855] [2019-10-22 08:57:42,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,736 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2019-10-22 08:57:42,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98816306] [2019-10-22 08:57:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2019-10-22 08:57:42,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672380830] [2019-10-22 08:57:42,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:42,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:43,475 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2019-10-22 08:57:43,787 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-10-22 08:57:43,844 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:43,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:43,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:43,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:43,844 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:43,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:43,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:43,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:43,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration4_Lasso [2019-10-22 08:57:43,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:43,845 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:43,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:43,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:44,215 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:44,215 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:44,215 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-10-22 08:57:44,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,218 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-10-22 08:57:44,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,220 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-10-22 08:57:44,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,221 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,222 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-10-22 08:57:44,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,223 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-10-22 08:57:44,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,225 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,230 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-10-22 08:57:44,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,231 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,231 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,232 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-10-22 08:57:44,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,237 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-10-22 08:57:44,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,247 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:44,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:44,250 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:57:44,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:44,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:44,252 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:44,252 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2019-10-22 08:57:44,254 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:57:44,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:57:44,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:44,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:57:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:57:44,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-10-22 08:57:44,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2019-10-22 08:57:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:57:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2019-10-22 08:57:44,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:57:44,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:57:44,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:44,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:57:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:57:44,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-10-22 08:57:44,681 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2019-10-22 08:57:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:57:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2019-10-22 08:57:44,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:57:44,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,686 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:57:44,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:44,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:44,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:57:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,812 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:57:44,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-10-22 08:57:44,888 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 154 states and 179 transitions. Complement of second has 19 states. [2019-10-22 08:57:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:57:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-10-22 08:57:44,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:57:44,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2019-10-22 08:57:44,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2019-10-22 08:57:44,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2019-10-22 08:57:44,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:44,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2019-10-22 08:57:44,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-10-22 08:57:44,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-10-22 08:57:44,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2019-10-22 08:57:44,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:44,901 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-10-22 08:57:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2019-10-22 08:57:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2019-10-22 08:57:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:57:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-10-22 08:57:44,910 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-10-22 08:57:44,910 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-10-22 08:57:44,910 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:44,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2019-10-22 08:57:44,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:44,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:44,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:44,912 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:44,912 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:44,913 INFO L791 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1356#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1357#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1371#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1374#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1378#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1376#recFINAL assume true; 1370#recEXIT >#30#return; 1366#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1368#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1372#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1373#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1400#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1352#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1360#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1351#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1353#recFINAL assume true; 1417#recEXIT >#28#return; 1406#L15-1 #res := #t~ret5;havoc #t~ret5; 1401#recFINAL assume true; 1377#recEXIT >#30#return; 1364#L23-1 [2019-10-22 08:57:44,913 INFO L793 eck$LassoCheckResult]: Loop: 1364#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1365#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1403#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1407#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1402#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1404#recFINAL assume true; 1408#recEXIT >#30#return; 1364#L23-1 [2019-10-22 08:57:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2019-10-22 08:57:44,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997441000] [2019-10-22 08:57:44,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,937 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2019-10-22 08:57:44,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796091765] [2019-10-22 08:57:44,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:44,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2019-10-22 08:57:44,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819374075] [2019-10-22 08:57:44,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:45,864 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 133 [2019-10-22 08:57:45,955 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:45,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:45,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:45,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:45,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:45,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:45,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:45,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:45,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration5_Lasso [2019-10-22 08:57:45,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:45,955 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:45,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:45,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:46,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:46,382 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:46,382 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:46,382 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-10-22 08:57:46,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:46,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:46,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:46,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:46,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:46,385 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-10-22 08:57:46,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:46,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:46,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,387 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:46,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:46,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:46,388 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-10-22 08:57:46,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:46,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:46,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:46,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:46,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:46,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:46,390 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-10-22 08:57:46,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,391 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:46,391 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:46,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,395 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-10-22 08:57:46,395 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:57:46,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:46,415 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-10-22 08:57:46,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:46,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:46,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,416 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:46,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:46,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:46,417 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-10-22 08:57:46,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:46,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:46,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:46,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:46,419 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:46,420 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:46,436 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:46,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:46,443 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:46,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:46,444 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:46,445 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:46,445 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:57:46,455 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:46,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:46,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:46,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 08:57:46,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-10-22 08:57:46,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2019-10-22 08:57:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-10-22 08:57:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-10-22 08:57:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:46,681 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:46,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:46,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:46,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 08:57:46,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-10-22 08:57:46,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2019-10-22 08:57:46,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-10-22 08:57:46,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-10-22 08:57:46,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:46,861 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:46,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:46,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:46,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:46,988 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-10-22 08:57:46,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-10-22 08:57:47,053 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 143 states and 169 transitions. Complement of second has 22 states. [2019-10-22 08:57:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2019-10-22 08:57:47,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2019-10-22 08:57:47,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:47,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2019-10-22 08:57:47,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:47,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2019-10-22 08:57:47,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:47,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2019-10-22 08:57:47,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:57:47,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2019-10-22 08:57:47,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-10-22 08:57:47,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-10-22 08:57:47,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2019-10-22 08:57:47,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:47,062 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2019-10-22 08:57:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2019-10-22 08:57:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2019-10-22 08:57:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:57:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-22 08:57:47,065 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:57:47,066 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:57:47,066 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:47,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-10-22 08:57:47,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:57:47,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:47,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:47,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:47,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:47,068 INFO L791 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2189#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2190#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2019-10-22 08:57:47,068 INFO L793 eck$LassoCheckResult]: Loop: 2204#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2205#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2209#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 2184#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2194#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2183#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2185#recFINAL assume true; 2206#recEXIT >#28#return; 2211#L15-1 #res := #t~ret5;havoc #t~ret5; 2210#recFINAL assume true; 2208#recEXIT >#30#return; 2198#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2200#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2019-10-22 08:57:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2019-10-22 08:57:47,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811232323] [2019-10-22 08:57:47,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2019-10-22 08:57:47,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780399251] [2019-10-22 08:57:47,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,090 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2019-10-22 08:57:47,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297268943] [2019-10-22 08:57:47,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,113 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:47,500 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-22 08:57:47,596 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:47,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:47,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:47,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:47,597 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:47,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:47,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:47,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:47,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration6_Lasso [2019-10-22 08:57:47,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:47,597 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:47,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:47,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:47,917 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:47,917 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-10-22 08:57:47,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:47,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:47,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:47,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:47,919 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:47,919 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:47,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:47,920 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-10-22 08:57:47,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:47,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:47,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:47,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:47,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:47,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:47,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:47,927 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-10-22 08:57:47,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:47,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:47,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:47,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:47,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:47,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:47,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:47,935 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-10-22 08:57:47,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:47,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:47,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:47,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:47,936 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:47,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:47,943 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:47,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:47,947 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:47,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:47,947 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:47,948 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:47,948 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:57:47,959 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:47,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:47,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:47,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:57:47,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:48,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 08:57:48,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:48,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:48,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:48,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-22 08:57:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:57:48,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 08:57:48,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-10-22 08:57:48,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 69 states and 86 transitions. Complement of second has 22 states. [2019-10-22 08:57:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 08:57:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-10-22 08:57:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2019-10-22 08:57:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2019-10-22 08:57:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:48,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2019-10-22 08:57:48,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:48,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2019-10-22 08:57:48,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:48,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-10-22 08:57:48,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:48,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:48,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:48,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:48,142 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:48,142 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:48,142 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:48,142 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:57:48,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:48,142 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:48,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:48,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:48 BoogieIcfgContainer [2019-10-22 08:57:48,150 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:48,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:48,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:48,150 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:48,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38" (3/4) ... [2019-10-22 08:57:48,154 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:48,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:48,155 INFO L168 Benchmark]: Toolchain (without parser) took 10598.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -290.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:48,156 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:48,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:48,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.19 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-10-22 08:57:48,158 INFO L168 Benchmark]: Boogie Preprocessor took 23.63 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-10-22 08:57:48,158 INFO L168 Benchmark]: RCFGBuilder took 346.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:48,159 INFO L168 Benchmark]: BuchiAutomizer took 9916.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:48,160 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:48,164 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.19 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 23.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 346.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9916.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.3 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 (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 127 SDtfs, 149 SDslu, 120 SDs, 0 SdLazy, 376 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital178 mio100 ax100 hnf100 lsp95 ukn59 mio100 lsp30 div100 bol100 ite100 ukn100 eq171 hnf90 smp97 dnf150 smp97 tf101 neg93 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...