./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.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_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/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 faaae9aa069653e753b732f00a89bd7a139fa132 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:02:35,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:35,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:35,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:35,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:35,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:35,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:35,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:35,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:35,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:35,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:35,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:35,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:35,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:35,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:35,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:35,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:35,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:35,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:35,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:35,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:35,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:35,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:35,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:35,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:35,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:35,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:35,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:35,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:35,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:35,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:35,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:35,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:35,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:35,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:35,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:35,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:35,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:35,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:35,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:35,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:35,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:35,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:35,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:35,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:35,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:35,700 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:35,700 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:35,700 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:35,700 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:35,700 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:35,701 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:35,701 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:35,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:35,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:35,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:35,702 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:35,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:35,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:35,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:35,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:35,703 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:35,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:35,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:35,704 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:35,705 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:35,705 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_27cc0c83-c7fe-4b73-9885-aac50f116163/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2019-10-22 09:02:35,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:35,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:35,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:35,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:35,769 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:35,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2019-10-22 09:02:35,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/data/924e885c5/732f40cf4e6947d4bb97f04174ee2c05/FLAG9b3072b6c [2019-10-22 09:02:36,213 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:36,213 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2019-10-22 09:02:36,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/data/924e885c5/732f40cf4e6947d4bb97f04174ee2c05/FLAG9b3072b6c [2019-10-22 09:02:36,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/data/924e885c5/732f40cf4e6947d4bb97f04174ee2c05 [2019-10-22 09:02:36,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:36,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:36,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:36,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:36,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:36,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39253b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:36,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:36,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:36,464 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:36,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:36,555 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:36,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36 WrapperNode [2019-10-22 09:02:36,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:36,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:36,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:36,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:36,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:36,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:36,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:36,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:36,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:36,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:36,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:36,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:36,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/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 09:02:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-10-22 09:02:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-10-22 09:02:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:02:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:36,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:36,876 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:36,876 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 09:02:36,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36 BoogieIcfgContainer [2019-10-22 09:02:36,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:36,878 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:36,878 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:36,882 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:36,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:36" (1/3) ... [2019-10-22 09:02:36,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66988817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (2/3) ... [2019-10-22 09:02:36,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66988817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/3) ... [2019-10-22 09:02:36,886 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C.i [2019-10-22 09:02:36,936 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:36,950 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:36,950 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:36,950 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:36,950 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:36,950 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:36,950 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:36,950 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:36,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:37,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:02:37,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:37,029 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,029 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:37,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:37,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:02:37,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:37,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,041 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L31-3true [2019-10-22 09:02:37,042 INFO L793 eck$LassoCheckResult]: Loop: 7#L31-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 18#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 12#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 15#recEXITtrue >#44#return; 6#L39-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 7#L31-3true [2019-10-22 09:02:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-10-22 09:02:37,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569085111] [2019-10-22 09:02:37,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-10-22 09:02:37,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605312064] [2019-10-22 09:02:37,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,365 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 09:02:37,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605312064] [2019-10-22 09:02:37,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:37,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:02:37,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772339484] [2019-10-22 09:02:37,371 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:37,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:02:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:37,384 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-10-22 09:02:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,497 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-10-22 09:02:37,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:37,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-10-22 09:02:37,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:02:37,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-10-22 09:02:37,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:02:37,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:02:37,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-10-22 09:02:37,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:37,511 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:02:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-10-22 09:02:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:02:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:02:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-22 09:02:37,537 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:02:37,538 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:02:37,538 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:37,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-10-22 09:02:37,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 09:02:37,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,539 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:37,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,540 INFO L791 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 63#L31-3 [2019-10-22 09:02:37,540 INFO L793 eck$LassoCheckResult]: Loop: 63#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 64#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 67#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 59#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 58#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 69#recFINAL assume true; 71#recEXIT >#42#return; 65#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 66#recFINAL assume true; 72#recEXIT >#44#return; 61#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 62#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 63#L31-3 [2019-10-22 09:02:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-10-22 09:02:37,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167929533] [2019-10-22 09:02:37,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-10-22 09:02:37,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028078421] [2019-10-22 09:02:37,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-10-22 09:02:37,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522143911] [2019-10-22 09:02:37,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:37,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,208 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-10-22 09:02:38,379 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-22 09:02:38,945 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-10-22 09:02:39,109 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-22 09:02:39,202 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:39,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:39,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:39,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:39,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:39,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:39,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:39,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:39,204 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration2_Lasso [2019-10-22 09:02:39,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:39,204 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:39,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,226 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 09:02:39,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:39,441 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-22 09:02:39,441 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 09:02:39,449 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 09:02:39,451 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 09:02:39,458 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 09:02:39,460 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 09:02:39,759 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-10-22 09:02:39,813 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:39,817 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:39,818 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 09:02:39,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,827 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 09:02:39,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,830 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 09:02:39,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,837 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 09:02:39,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,840 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,864 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 09:02:39,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:39,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,869 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,902 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:39,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:39,918 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:39,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:39,924 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:39,924 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:39,925 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-10-22 09:02:39,937 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:39,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:40,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 09:02:40,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:40,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:40,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-10-22 09:02:40,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:40,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:40,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:40,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-10-22 09:02:40,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 09:02:40,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:40,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:40,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:40,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-10-22 09:02:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:02:40,179 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 09:02:40,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-10-22 09:02:40,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-10-22 09:02:40,324 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 09:02:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:02:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-10-22 09:02:40,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-10-22 09:02:40,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-10-22 09:02:40,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-10-22 09:02:40,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-10-22 09:02:40,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 09:02:40,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-10-22 09:02:40,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-10-22 09:02:40,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 09:02:40,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-10-22 09:02:40,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:40,337 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 09:02:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-10-22 09:02:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-10-22 09:02:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 09:02:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-10-22 09:02:40,342 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-10-22 09:02:40,342 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-10-22 09:02:40,343 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:40,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-10-22 09:02:40,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 09:02:40,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:40,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:40,345 INFO L791 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 273#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 274#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 262#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 296#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 263#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 264#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 295#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 248#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-10-22 09:02:40,345 INFO L793 eck$LassoCheckResult]: Loop: 246#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 249#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 247#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-10-22 09:02:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-10-22 09:02:40,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687134740] [2019-10-22 09:02:40,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-10-22 09:02:40,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303548452] [2019-10-22 09:02:40,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,391 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-10-22 09:02:40,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951340786] [2019-10-22 09:02:40,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,552 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-22 09:02:41,088 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-10-22 09:02:41,480 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 109 [2019-10-22 09:02:41,580 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:41,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:41,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:41,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:41,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:41,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:41,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:41,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:41,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration3_Lasso [2019-10-22 09:02:41,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:41,581 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:41,584 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 09:02:41,601 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 09:02:41,603 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 09:02:41,604 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 09:02:41,606 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 09:02:41,608 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 09:02:41,609 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 09:02:41,611 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 09:02:41,616 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 09:02:41,617 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 09:02:41,619 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 09:02:41,622 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 09:02:41,623 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 09:02:41,624 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 09:02:41,813 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 09:02:41,814 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 09:02:41,815 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 09:02:41,816 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 09:02:41,817 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 09:02:41,818 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 09:02:41,820 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 09:02:41,821 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 09:02:41,823 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 09:02:41,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,825 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 09:02:41,826 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 09:02:41,827 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 09:02:41,828 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 09:02:41,829 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 09:02:41,830 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 09:02:41,831 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 09:02:41,832 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 09:02:41,833 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 09:02:41,835 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 09:02:41,836 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 09:02:42,179 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-10-22 09:02:42,207 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:42,207 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:42,207 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 09:02:42,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,210 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 09:02:42,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,213 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 09:02:42,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,213 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,215 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,217 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,219 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,219 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,221 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,222 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,224 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,225 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 09:02:42,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,228 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,229 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,231 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,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 09:02:42,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,239 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 09:02:42,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,241 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,242 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 09:02:42,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,244 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,252 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 09:02:42,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,255 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 09:02:42,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,259 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,287 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:42,294 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:42,294 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:02:42,295 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:42,296 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:42,296 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:42,296 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-10-22 09:02:42,316 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 09:02:42,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:42,398 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 09:02:42,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:42,423 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 09:02:42,424 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 09:02:42,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 09:02:42,435 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 09:02:42,435 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 09:02:42,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 09:02:42,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-10-22 09:02:42,498 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 09:02:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-10-22 09:02:42,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 09:02:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 09:02:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 09:02:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-10-22 09:02:42,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 09:02:42,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-10-22 09:02:42,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-10-22 09:02:42,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-10-22 09:02:42,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-10-22 09:02:42,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:42,507 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-10-22 09:02:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-10-22 09:02:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-10-22 09:02:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 09:02:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-10-22 09:02:42,515 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-22 09:02:42,515 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-22 09:02:42,515 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:42,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-10-22 09:02:42,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 09:02:42,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:42,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:42,519 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:42,519 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:42,519 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 511#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 489#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 491#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 508#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 528#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 557#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 556#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 479#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 478#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 481#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 510#recFINAL assume true; 518#recEXIT >#42#return; 532#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 530#recFINAL assume true; 527#recEXIT >#44#return; 485#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 486#L39-3 [2019-10-22 09:02:42,520 INFO L793 eck$LassoCheckResult]: Loop: 486#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 522#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 533#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 531#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 506#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 507#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 542#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 537#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 507#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 542#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 543#recFINAL assume true; 550#recEXIT >#42#return; 538#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 539#recFINAL assume true; 536#recEXIT >#44#return; 526#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 486#L39-3 [2019-10-22 09:02:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-10-22 09:02:42,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141905785] [2019-10-22 09:02:42,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:42,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141905785] [2019-10-22 09:02:42,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644305732] [2019-10-22 09:02:42,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27cc0c83-c7fe-4b73-9885-aac50f116163/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:42,793 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 1 case distinctions, treesize of input 25 treesize of output 46 [2019-10-22 09:02:42,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:42,808 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-10-22 09:02:42,809 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 09:02:42,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-10-22 09:02:42,853 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 26 treesize of output 14 [2019-10-22 09:02:42,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:42,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:42,858 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 09:02:42,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-10-22 09:02:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:42,864 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:42,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-10-22 09:02:42,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709105477] [2019-10-22 09:02:42,865 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-10-22 09:02:42,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170363946] [2019-10-22 09:02:42,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,153 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-10-22 09:02:43,596 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2019-10-22 09:02:43,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:43,669 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-10-22 09:02:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:43,786 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-10-22 09:02:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:02:43,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-10-22 09:02:43,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:43,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-10-22 09:02:43,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:02:43,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:02:43,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-10-22 09:02:43,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:43,790 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-10-22 09:02:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-10-22 09:02:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-10-22 09:02:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 09:02:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-10-22 09:02:43,795 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 09:02:43,795 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 09:02:43,795 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:43,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-10-22 09:02:43,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:02:43,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:43,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:43,797 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:43,797 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:02:43,797 INFO L791 eck$LassoCheckResult]: Stem: 757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 755#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 741#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 742#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 754#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 763#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 775#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 774#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 736#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 735#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 738#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 756#recFINAL assume true; 766#recEXIT >#42#return; 765#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 764#recFINAL assume true; 762#recEXIT >#44#return; 739#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 740#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 743#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 745#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 753#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 732#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 731#recENTRY [2019-10-22 09:02:43,797 INFO L793 eck$LassoCheckResult]: Loop: 731#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 733#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 734#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 731#recENTRY [2019-10-22 09:02:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-10-22 09:02:43,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24210266] [2019-10-22 09:02:43,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,833 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-10-22 09:02:43,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804831228] [2019-10-22 09:02:43,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-10-22 09:02:43,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226150675] [2019-10-22 09:02:43,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,289 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-10-22 09:02:45,617 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 230 DAG size of output: 199 [2019-10-22 09:02:45,969 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-10-22 09:02:46,307 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-10-22 09:02:46,507 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-22 09:02:46,515 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:46,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:46,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:46,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:46,515 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:46,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:46,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:46,515 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:46,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration5_Lasso [2019-10-22 09:02:46,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:46,516 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:46,518 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 09:02:46,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,531 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 09:02:46,533 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 09:02:46,534 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 09:02:46,535 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 09:02:46,536 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 09:02:46,538 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 09:02:46,539 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 09:02:46,540 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 09:02:46,542 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 09:02:46,731 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 09:02:46,733 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 09:02:46,734 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 09:02:46,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,736 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 09:02:46,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,738 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 09:02:46,739 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 09:02:46,742 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 09:02:46,743 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 09:02:46,744 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 09:02:46,746 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 09:02:46,747 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 09:02:46,748 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 09:02:46,749 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 09:02:46,750 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 09:02:46,751 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 09:02:46,752 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 09:02:46,753 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 09:02:46,754 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 09:02:46,755 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 09:02:46,756 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 09:02:46,757 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 09:02:46,758 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 09:02:47,162 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:02:47,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:47,184 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:47,184 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 09:02:47,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,186 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 09:02:47,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,188 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 09:02:47,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,189 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,190 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 09:02:47,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,191 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,192 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 09:02:47,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,194 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 09:02:47,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,197 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 09:02:47,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,199 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 09:02:47,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,201 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 09:02:47,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:47,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:47,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:47,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,203 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 09:02:47,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:47,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,207 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,212 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 09:02:47,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,214 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:47,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,217 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,217 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:47,219 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 09:02:47,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:47,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:47,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:47,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:47,220 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:47,220 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:47,226 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:47,228 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:47,228 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:02:47,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:47,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:47,230 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:47,230 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-10-22 09:02:47,243 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 09:02:47,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:47,370 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 09:02:47,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:47,393 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 09:02:47,394 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 09:02:47,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 09:02:47,406 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 09:02:47,406 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 09:02:47,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:02:47,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-10-22 09:02:47,460 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 09:02:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 09:02:47,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 09:02:47,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,461 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:47,561 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 09:02:47,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:47,579 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 09:02:47,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 09:02:47,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 09:02:47,588 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 09:02:47,588 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 09:02:47,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:02:47,636 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-10-22 09:02:47,639 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 09:02:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-10-22 09:02:47,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 09:02:47,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,640 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 09:02:47,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:47,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:47,747 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 09:02:47,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:47,768 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 09:02:47,768 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 09:02:47,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 09:02:47,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 09:02:47,779 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 09:02:47,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:02:47,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-10-22 09:02:47,864 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 09:02:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-10-22 09:02:47,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 09:02:47,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-10-22 09:02:47,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 09:02:47,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:47,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-10-22 09:02:47,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:47,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-10-22 09:02:47,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:47,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:47,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:47,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:47,866 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:47,866 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:47,866 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:47,866 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:47,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:47,867 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:47,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:47,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:47 BoogieIcfgContainer [2019-10-22 09:02:47,872 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:47,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:47,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:47,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:47,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/4) ... [2019-10-22 09:02:47,876 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:47,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:47,878 INFO L168 Benchmark]: Toolchain (without parser) took 11640.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,878 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:47,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.46 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 09:02:47,879 INFO L168 Benchmark]: Boogie Preprocessor took 21.35 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,880 INFO L168 Benchmark]: RCFGBuilder took 264.65 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,880 INFO L168 Benchmark]: BuchiAutomizer took 10994.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -50.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,880 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,884 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.46 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 21.35 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.65 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10994.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -50.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 61 SDslu, 154 SDs, 0 SdLazy, 254 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp29 div100 bol100 ite100 ukn100 eq180 hnf93 smp100 dnf445 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...