./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i -s /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/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 2aaf551f63785020042d5272893266519060a07e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:56:10,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:56:10,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:56:10,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:56:10,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:56:10,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:56:10,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:56:10,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:56:10,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:56:10,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:56:10,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:56:10,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:56:10,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:56:10,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:56:10,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:56:10,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:56:10,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:56:10,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:56:10,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:56:10,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:56:10,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:56:10,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:56:10,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:56:10,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:56:10,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:56:10,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:56:10,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:56:10,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:56:10,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:56:10,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:56:10,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:56:10,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:56:10,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:56:10,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:56:10,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:56:10,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:56:10,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:56:10,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:56:10,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:56:10,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:56:10,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:56:10,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 19:56:10,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:56:10,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:56:10,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:56:10,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:56:10,744 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:56:10,744 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 19:56:10,744 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 19:56:10,744 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 19:56:10,745 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 19:56:10,745 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 19:56:10,745 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 19:56:10,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:56:10,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:56:10,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:56:10,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:56:10,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 19:56:10,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 19:56:10,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 19:56:10,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:56:10,747 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 19:56:10,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:56:10,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 19:56:10,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:56:10,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:56:10,748 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 19:56:10,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:56:10,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:56:10,749 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 19:56:10,750 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 19:56:10,750 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/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 -> 2aaf551f63785020042d5272893266519060a07e [2019-11-15 19:56:10,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:56:10,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:56:10,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:56:10,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:56:10,793 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:56:10,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2019-11-15 19:56:10,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/data/d8bb97903/00157c3c2ab94e018ed09e597ade8dce/FLAGad36e3c80 [2019-11-15 19:56:11,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:56:11,249 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex9.i [2019-11-15 19:56:11,254 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/data/d8bb97903/00157c3c2ab94e018ed09e597ade8dce/FLAGad36e3c80 [2019-11-15 19:56:11,652 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/data/d8bb97903/00157c3c2ab94e018ed09e597ade8dce [2019-11-15 19:56:11,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:56:11,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:56:11,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:11,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:56:11,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:56:11,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:11" (1/1) ... [2019-11-15 19:56:11,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37621500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:11, skipping insertion in model container [2019-11-15 19:56:11,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:11" (1/1) ... [2019-11-15 19:56:11,675 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:56:11,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:56:11,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:11,973 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:56:12,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:12,021 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:56:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12 WrapperNode [2019-11-15 19:56:12,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:12,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:12,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:56:12,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:56:12,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:12,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:56:12,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:56:12,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:56:12,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... [2019-11-15 19:56:12,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:56:12,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:56:12,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:56:12,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:56:12,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:56:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 19:56:12,196 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 19:56:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:56:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:56:12,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:56:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:56:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:56:12,439 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:56:12,440 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 19:56:12,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:12 BoogieIcfgContainer [2019-11-15 19:56:12,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:56:12,442 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 19:56:12,442 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 19:56:12,446 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 19:56:12,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:12,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 07:56:11" (1/3) ... [2019-11-15 19:56:12,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ced6b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:56:12, skipping insertion in model container [2019-11-15 19:56:12,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:12,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:12" (2/3) ... [2019-11-15 19:56:12,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ced6b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:56:12, skipping insertion in model container [2019-11-15 19:56:12,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:56:12,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:12" (3/3) ... [2019-11-15 19:56:12,451 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex9.i [2019-11-15 19:56:12,494 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 19:56:12,494 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 19:56:12,494 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 19:56:12,494 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:56:12,494 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:56:12,495 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 19:56:12,495 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:56:12,495 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 19:56:12,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 19:56:12,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:12,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:12,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:12,543 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:12,543 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:12,543 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 19:56:12,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 19:56:12,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:12,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:12,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:12,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:12,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:12,553 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 3#L29-3true [2019-11-15 19:56:12,554 INFO L793 eck$LassoCheckResult]: Loop: 3#L29-3true call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 6#L29-1true assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 13#L33true call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 5#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 9#L9true assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 16#recFINALtrue assume true; 14#recEXITtrue >#33#return; 12#L33-1true havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 3#L29-3true [2019-11-15 19:56:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 19:56:12,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:12,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608097175] [2019-11-15 19:56:12,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:12,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:12,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:12,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2019-11-15 19:56:12,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:12,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022214949] [2019-11-15 19:56:12,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:12,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:12,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:12,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022214949] [2019-11-15 19:56:12,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:12,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:56:12,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773137367] [2019-11-15 19:56:12,968 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:56:12,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:56:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:56:12,982 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2019-11-15 19:56:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:13,134 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-15 19:56:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:56:13,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-15 19:56:13,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:13,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2019-11-15 19:56:13,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 19:56:13,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 19:56:13,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-15 19:56:13,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:56:13,150 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 19:56:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-15 19:56:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 19:56:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:56:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 19:56:13,175 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 19:56:13,176 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 19:56:13,176 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 19:56:13,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-15 19:56:13,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:13,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:13,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:13,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:13,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:13,178 INFO L791 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 55#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 56#L29-3 [2019-11-15 19:56:13,178 INFO L793 eck$LassoCheckResult]: Loop: 56#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 58#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 64#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 57#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 60#recFINAL assume true; 67#recEXIT >#31#return; 62#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 63#recFINAL assume true; 68#recEXIT >#33#return; 66#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 56#L29-3 [2019-11-15 19:56:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-15 19:56:13,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:13,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196387373] [2019-11-15 19:56:13,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:13,225 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2019-11-15 19:56:13,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:13,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755187374] [2019-11-15 19:56:13,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:13,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1849555021, now seen corresponding path program 1 times [2019-11-15 19:56:13,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:13,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227010721] [2019-11-15 19:56:13,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:13,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:56:13,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227010721] [2019-11-15 19:56:13,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907151635] [2019-11-15 19:56:13,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:13,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 19:56:13,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:13,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 19:56:13,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:13,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:13,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:13,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-15 19:56:13,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:13,770 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 17 treesize of output 9 [2019-11-15 19:56:13,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:13,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:13,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:13,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:111, output treesize:3 [2019-11-15 19:56:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:56:13,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:13,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-15 19:56:13,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626696160] [2019-11-15 19:56:14,247 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 19:56:14,433 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 19:56:15,000 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-11-15 19:56:15,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 19:56:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:56:15,087 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 19:56:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:15,221 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-15 19:56:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:56:15,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-15 19:56:15,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:15,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 19:56:15,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 19:56:15,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 19:56:15,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-15 19:56:15,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:56:15,226 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 19:56:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-15 19:56:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 19:56:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 19:56:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 19:56:15,229 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 19:56:15,229 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 19:56:15,229 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 19:56:15,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-15 19:56:15,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:56:15,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:56:15,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:56:15,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 19:56:15,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:15,232 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 170#L29-3 [2019-11-15 19:56:15,248 INFO L793 eck$LassoCheckResult]: Loop: 170#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 177#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 172#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 178#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 171#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 173#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 178#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 171#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 173#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 178#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 171#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 174#recFINAL assume true; 181#recEXIT >#31#return; 175#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 176#recFINAL assume true; 185#recEXIT >#31#return; 183#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 184#recFINAL assume true; 182#recEXIT >#33#return; 179#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 170#L29-3 [2019-11-15 19:56:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-15 19:56:15,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:15,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037475330] [2019-11-15 19:56:15,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,283 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2019-11-15 19:56:15,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:15,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737938831] [2019-11-15 19:56:15,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,353 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1421169023, now seen corresponding path program 2 times [2019-11-15 19:56:15,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:15,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347744070] [2019-11-15 19:56:15,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:15,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:56:15,411 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:56:15,740 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 19:56:16,086 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-15 19:56:16,720 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2019-11-15 19:56:16,837 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-15 19:56:16,946 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-15 19:56:17,017 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:56:17,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:56:17,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:56:17,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:56:17,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:56:17,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:56:17,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:56:17,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:56:17,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration3_Lasso [2019-11-15 19:56:17,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:56:17,019 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:56:17,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,242 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-15 19:56:17,404 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-15 19:56:17,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:56:17,771 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 19:56:17,880 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-11-15 19:56:18,030 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:56:18,034 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:56:18,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:18,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:18,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:18,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:18,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:18,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:18,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:56:18,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:56:18,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:56:18,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:56:18,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:56:18,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,057 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:56:18,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:56:18,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,062 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:56:18,062 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-15 19:56:18,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,092 INFO L400 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2019-11-15 19:56:18,092 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-15 19:56:18,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,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-11-15 19:56:18,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:56:18,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:56:18,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:56:18,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:56:18,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:56:18,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:56:18,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:56:18,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:56:18,247 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:56:18,248 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:56:18,259 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:56:18,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:56:18,271 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:56:18,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:56:18,274 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:56:18,275 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:56:18,275 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-11-15 19:56:18,318 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 19:56:18,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 19:56:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:18,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:56:18,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:18,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 19:56:18,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:18,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:18,442 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 110 treesize of output 47 [2019-11-15 19:56:18,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:18,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:18,480 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2019-11-15 19:56:18,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:18,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:53 [2019-11-15 19:56:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:30,875 INFO L392 ElimStorePlain]: Different costs {2=[|v_#valid_BEFORE_CALL_4|], 4=[v_prenex_5]} [2019-11-15 19:56:30,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:30,893 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 56 treesize of output 60 [2019-11-15 19:56:30,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:30,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:30,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:30,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 86 [2019-11-15 19:56:30,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:31,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:31,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-11-15 19:56:31,045 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:31,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:31,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:31,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 67 [2019-11-15 19:56:31,127 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:31,209 INFO L567 ElimStorePlain]: treesize reduction 20, result has 83.9 percent of original size [2019-11-15 19:56:31,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 19:56:31,212 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:123, output treesize:94 [2019-11-15 19:56:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:56:31,278 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2019-11-15 19:56:31,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2019-11-15 19:57:19,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 14 states. Result 53 states and 61 transitions. Complement of second has 25 states. [2019-11-15 19:57:19,797 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-11-15 19:57:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:57:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-11-15 19:57:19,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 13 transitions. Stem has 2 letters. Loop has 20 letters. [2019-11-15 19:57:19,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:19,801 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:57:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:19,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:19,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:19,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 19:57:19,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:19,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:19,916 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 110 treesize of output 47 [2019-11-15 19:57:19,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:19,962 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2019-11-15 19:57:19,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:19,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:127, output treesize:53 [2019-11-15 19:57:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:27,003 INFO L392 ElimStorePlain]: Different costs {4=[v_prenex_16], 7=[|v_#valid_BEFORE_CALL_8|]} [2019-11-15 19:57:27,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2019-11-15 19:57:27,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:27,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 113 [2019-11-15 19:57:27,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:27,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2019-11-15 19:57:27,177 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:27,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:27,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2019-11-15 19:57:27,238 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:27,320 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.5 percent of original size [2019-11-15 19:57:27,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 19:57:27,322 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:133, output treesize:90 [2019-11-15 19:57:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:57:27,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2019-11-15 19:57:27,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 14 states. [2019-11-15 19:57:27,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 14 states. Result 69 states and 79 transitions. Complement of second has 33 states. [2019-11-15 19:57:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 19:57:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2019-11-15 19:57:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 2 letters. Loop has 20 letters. [2019-11-15 19:57:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 22 letters. Loop has 20 letters. [2019-11-15 19:57:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:27,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 18 transitions. Stem has 2 letters. Loop has 40 letters. [2019-11-15 19:57:27,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:27,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2019-11-15 19:57:27,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:57:27,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 62 transitions. [2019-11-15 19:57:27,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 19:57:27,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 19:57:27,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 62 transitions. [2019-11-15 19:57:27,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:27,786 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-15 19:57:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 62 transitions. [2019-11-15 19:57:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-15 19:57:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 19:57:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-11-15 19:57:27,793 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-15 19:57:27,793 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-11-15 19:57:27,793 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 19:57:27,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 62 transitions. [2019-11-15 19:57:27,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:57:27,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:27,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:27,796 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:27,796 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:27,796 INFO L791 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 606#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 607#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 618#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 620#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 619#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 621#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 609#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 632#recENTRY [2019-11-15 19:57:27,796 INFO L793 eck$LassoCheckResult]: Loop: 632#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 646#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 610#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 632#recENTRY [2019-11-15 19:57:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -15910302, now seen corresponding path program 1 times [2019-11-15 19:57:27,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:27,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28264077] [2019-11-15 19:57:27,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,823 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2019-11-15 19:57:27,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:27,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181769644] [2019-11-15 19:57:27,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,835 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1537404168, now seen corresponding path program 2 times [2019-11-15 19:57:27,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:27,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006540678] [2019-11-15 19:57:27,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:27,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:27,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:28,662 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2019-11-15 19:57:28,778 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 19:57:29,265 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2019-11-15 19:57:29,381 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 19:57:29,383 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:29,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:29,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:29,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:29,383 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:29,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:29,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:29,383 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:29,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration4_Lasso [2019-11-15 19:57:29,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:29,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,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-11-15 19:57:29,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-11-15 19:57:29,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:29,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-11-15 19:57:29,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-11-15 19:57:29,875 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 19:57:29,897 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:29,898 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:29,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,911 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,912 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,912 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:29,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:29,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,918 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,918 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,920 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,927 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,930 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,930 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,932 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,933 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,938 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,941 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,949 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:29,949 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:29,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,955 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,957 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:29,957 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:29,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:29,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:29,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:29,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:29,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:29,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:29,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:29,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:29,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:29,965 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:29,966 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:57:29,966 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 19:57:29,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:29,966 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 19:57:29,966 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:29,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~i) = 2*rec_#in~i + 1 Supporting invariants [] [2019-11-15 19:57:29,971 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 19:57:29,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:30,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:30,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:30,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:57:30,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:30,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 19:57:30,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-15 19:57:30,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 62 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 98 states and 123 transitions. Complement of second has 13 states. [2019-11-15 19:57:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 19:57:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 19:57:30,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 19:57:30,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:30,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 19:57:30,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:30,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 19:57:30,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:30,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2019-11-15 19:57:30,158 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:57:30,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 78 states and 100 transitions. [2019-11-15 19:57:30,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 19:57:30,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-15 19:57:30,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 100 transitions. [2019-11-15 19:57:30,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:30,163 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-15 19:57:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 100 transitions. [2019-11-15 19:57:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-15 19:57:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 19:57:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-15 19:57:30,176 INFO L711 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-15 19:57:30,176 INFO L591 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-15 19:57:30,176 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 19:57:30,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 100 transitions. [2019-11-15 19:57:30,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:57:30,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:30,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:30,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 19:57:30,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:30,180 INFO L791 eck$LassoCheckResult]: Stem: 847#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 824#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 825#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 836#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 848#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 849#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 889#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 822#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 888#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 821#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 823#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 842#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 843#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 890#recFINAL assume true; 895#recEXIT >#31#return; 832#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 835#recFINAL assume true; 887#recEXIT >#31#return; 865#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 864#recFINAL assume true; 860#recEXIT >#33#return; 846#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 838#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 840#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 858#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 883#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 881#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 829#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 873#recENTRY [2019-11-15 19:57:30,180 INFO L793 eck$LassoCheckResult]: Loop: 873#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 877#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 830#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 873#recENTRY [2019-11-15 19:57:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash -892002912, now seen corresponding path program 3 times [2019-11-15 19:57:30,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:30,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054681350] [2019-11-15 19:57:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:30,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 19:57:31,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054681350] [2019-11-15 19:57:31,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519560145] [2019-11-15 19:57:31,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:57:31,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 19:57:31,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:57:31,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 19:57:31,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:31,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 19:57:31,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:31,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:31,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:31,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:10 [2019-11-15 19:57:31,208 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 95 treesize of output 17 [2019-11-15 19:57:31,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:31,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:31,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:31,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:24 [2019-11-15 19:57:32,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:57:32,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:32,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:32,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:32,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:32 [2019-11-15 19:57:32,801 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:32,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2019-11-15 19:57:32,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:32,851 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-11-15 19:57:32,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:32,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:45 [2019-11-15 19:57:32,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:32,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-11-15 19:57:32,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2019-11-15 19:57:33,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,077 INFO L567 ElimStorePlain]: treesize reduction 18, result has 76.3 percent of original size [2019-11-15 19:57:33,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:33,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:60, output treesize:49 [2019-11-15 19:57:33,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-11-15 19:57:33,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 86 [2019-11-15 19:57:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,259 INFO L567 ElimStorePlain]: treesize reduction 68, result has 55.6 percent of original size [2019-11-15 19:57:33,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-15 19:57:33,260 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:84 [2019-11-15 19:57:33,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:33,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 46 [2019-11-15 19:57:33,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2019-11-15 19:57:33,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-15 19:57:33,369 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:33,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:33,376 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:108, output treesize:3 [2019-11-15 19:57:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:57:33,417 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:57:33,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-15 19:57:33,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249110803] [2019-11-15 19:57:33,418 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:57:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2019-11-15 19:57:33,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:33,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575872624] [2019-11-15 19:57:33,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:33,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:33,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:33,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:33,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:57:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=848, Unknown=1, NotChecked=0, Total=930 [2019-11-15 19:57:33,616 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. cyclomatic complexity: 28 Second operand 31 states. [2019-11-15 19:57:35,426 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-11-15 19:57:37,801 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-11-15 19:57:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:53,286 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2019-11-15 19:57:53,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 19:57:53,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2019-11-15 19:57:53,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:57:53,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 41 states and 51 transitions. [2019-11-15 19:57:53,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 19:57:53,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 19:57:53,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-11-15 19:57:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:53,292 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-15 19:57:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-11-15 19:57:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 19:57:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 19:57:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2019-11-15 19:57:53,298 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-15 19:57:53,298 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-15 19:57:53,298 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 19:57:53,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2019-11-15 19:57:53,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:57:53,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:53,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:53,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:53,302 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:53,302 INFO L791 eck$LassoCheckResult]: Stem: 1147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1129#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 1130#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1163#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1151#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1161#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1159#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1136#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1152#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1135#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1133#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1145#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1146#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1132#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1145#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1131#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1134#recFINAL assume true; 1150#recEXIT >#31#return; 1165#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1164#recFINAL assume true; 1162#recEXIT >#31#return; 1160#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1158#recFINAL assume true; 1157#recEXIT >#31#return; 1154#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1155#recFINAL assume true; 1153#recEXIT >#33#return; 1148#L33-1 [2019-11-15 19:57:53,302 INFO L793 eck$LassoCheckResult]: Loop: 1148#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 1141#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1142#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1138#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1144#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1139#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1144#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1139#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1144#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1139#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1144#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1139#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1144#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1167#recFINAL assume true; 1149#recEXIT >#31#return; 1137#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1140#recFINAL assume true; 1169#recEXIT >#31#return; 1168#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1166#recFINAL assume true; 1156#recEXIT >#31#return; 1154#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1155#recFINAL assume true; 1153#recEXIT >#31#return; 1154#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1155#recFINAL assume true; 1153#recEXIT >#33#return; 1148#L33-1 [2019-11-15 19:57:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1048585469, now seen corresponding path program 1 times [2019-11-15 19:57:53,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:53,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886709328] [2019-11-15 19:57:53,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:53,341 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash -195458237, now seen corresponding path program 3 times [2019-11-15 19:57:53,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:53,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946785653] [2019-11-15 19:57:53,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:53,383 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2091065787, now seen corresponding path program 4 times [2019-11-15 19:57:53,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:53,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308934731] [2019-11-15 19:57:53,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:53,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 34 proven. 106 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 19:57:54,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308934731] [2019-11-15 19:57:54,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779411607] [2019-11-15 19:57:54,398 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:57:54,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 19:57:54,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:57:54,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 19:57:54,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:54,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:54,597 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 95 treesize of output 33 [2019-11-15 19:57:54,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:54,613 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-11-15 19:57:54,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:54,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:21 [2019-11-15 19:57:57,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:57,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 79 [2019-11-15 19:57:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,504 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.4 percent of original size [2019-11-15 19:57:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:57,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:58 [2019-11-15 19:57:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:57,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 104 [2019-11-15 19:57:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2019-11-15 19:57:57,655 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,750 INFO L567 ElimStorePlain]: treesize reduction 124, result has 40.7 percent of original size [2019-11-15 19:57:57,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:57:57,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:73 [2019-11-15 19:57:57,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:57,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:57,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 19:57:57,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:57,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 19:57:57,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,851 INFO L567 ElimStorePlain]: treesize reduction 11, result has 42.1 percent of original size [2019-11-15 19:57:57,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:57,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:259, output treesize:3 [2019-11-15 19:57:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 30 proven. 130 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 19:57:57,909 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:57:57,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2019-11-15 19:57:57,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529200966] [2019-11-15 19:57:58,176 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 19:57:58,528 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-11-15 19:57:58,976 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 19:57:59,253 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 19:57:59,720 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-15 19:57:59,946 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 19:58:00,058 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 19:58:01,126 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2019-11-15 19:58:01,404 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 19:58:01,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:58:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 19:58:01,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1000, Unknown=1, NotChecked=0, Total=1122 [2019-11-15 19:58:01,405 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. cyclomatic complexity: 13 Second operand 34 states. [2019-11-15 19:58:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:58:17,759 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2019-11-15 19:58:17,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 19:58:17,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 76 transitions. [2019-11-15 19:58:17,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:58:17,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 44 states and 55 transitions. [2019-11-15 19:58:17,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-15 19:58:17,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-15 19:58:17,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2019-11-15 19:58:17,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:58:17,766 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-15 19:58:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2019-11-15 19:58:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 19:58:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 19:58:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-11-15 19:58:17,771 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-15 19:58:17,771 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-11-15 19:58:17,771 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 19:58:17,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2019-11-15 19:58:17,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 19:58:17,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:58:17,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:58:17,774 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:58:17,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 19:58:17,775 INFO L791 eck$LassoCheckResult]: Stem: 1631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1620#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 1621#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1652#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1632#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1633#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1655#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1627#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1626#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1628#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1616#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1629#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1619#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1617#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1629#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1619#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1617#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1629#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1615#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1618#recFINAL assume true; 1634#recEXIT >#31#return; 1622#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1623#recFINAL assume true; 1658#recEXIT >#31#return; 1657#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1656#recFINAL assume true; 1644#recEXIT >#31#return; 1642#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1641#recFINAL assume true; 1640#recEXIT >#31#return; 1638#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1639#recFINAL assume true; 1636#recEXIT >#33#return; 1630#L33-1 [2019-11-15 19:58:17,775 INFO L793 eck$LassoCheckResult]: Loop: 1630#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 1624#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1625#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 1635#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 1645#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1648#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1637#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1645#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1648#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1637#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1645#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1648#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1637#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1645#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1648#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 1637#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 1645#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 1648#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 1649#recFINAL assume true; 1654#recEXIT >#31#return; 1653#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1651#recFINAL assume true; 1650#recEXIT >#31#return; 1647#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1646#recFINAL assume true; 1643#recEXIT >#31#return; 1642#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1641#recFINAL assume true; 1640#recEXIT >#31#return; 1638#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 1639#recFINAL assume true; 1636#recEXIT >#33#return; 1630#L33-1 [2019-11-15 19:58:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1075606773, now seen corresponding path program 2 times [2019-11-15 19:58:17,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:17,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68988839] [2019-11-15 19:58:17,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:17,816 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:58:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:17,817 INFO L82 PathProgramCache]: Analyzing trace with hash -195458237, now seen corresponding path program 4 times [2019-11-15 19:58:17,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:17,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646480499] [2019-11-15 19:58:17,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:17,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:58:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2001023031, now seen corresponding path program 5 times [2019-11-15 19:58:17,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:17,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031807616] [2019-11-15 19:58:17,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 36 proven. 140 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 19:58:18,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031807616] [2019-11-15 19:58:18,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53378441] [2019-11-15 19:58:18,792 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:58:18,991 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 19:58:18,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:58:18,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 19:58:18,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:58:19,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:58:19,061 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 95 treesize of output 33 [2019-11-15 19:58:19,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:19,077 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-11-15 19:58:19,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:58:19,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:21 [2019-11-15 19:58:21,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:58:21,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 79 [2019-11-15 19:58:21,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:21,618 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.0 percent of original size [2019-11-15 19:58:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:58:21,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:58 [2019-11-15 19:58:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:58:21,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2019-11-15 19:58:21,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:21,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:58:21,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 82 [2019-11-15 19:58:21,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:21,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:21,900 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2019-11-15 19:58:21,901 INFO L567 ElimStorePlain]: treesize reduction 82, result has 54.7 percent of original size [2019-11-15 19:58:21,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 19:58:21,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:95 [2019-11-15 19:58:22,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:58:22,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:58:22,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 19:58:22,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:22,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:58:22,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 19:58:22,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:22,091 INFO L567 ElimStorePlain]: treesize reduction 11, result has 42.1 percent of original size [2019-11-15 19:58:22,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:58:22,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:259, output treesize:3 [2019-11-15 19:58:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 31 proven. 170 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 19:58:22,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:58:22,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 34 [2019-11-15 19:58:22,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441408113] [2019-11-15 19:58:22,488 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 19:58:23,004 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-15 19:58:23,500 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 19:58:23,673 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 19:58:24,120 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-15 19:58:24,332 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 19:58:24,442 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 19:58:25,416 WARN L191 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2019-11-15 19:58:25,677 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 19:58:25,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:58:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 19:58:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1056, Unknown=1, NotChecked=0, Total=1190 [2019-11-15 19:58:25,678 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 14 Second operand 35 states. [2019-11-15 19:58:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:58:36,617 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2019-11-15 19:58:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 19:58:36,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 86 transitions. [2019-11-15 19:58:36,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:58:36,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 80 transitions. [2019-11-15 19:58:36,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-11-15 19:58:36,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-11-15 19:58:36,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2019-11-15 19:58:36,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:58:36,624 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-11-15 19:58:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2019-11-15 19:58:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-15 19:58:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 19:58:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-11-15 19:58:36,630 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-15 19:58:36,630 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-15 19:58:36,630 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 19:58:36,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 71 transitions. [2019-11-15 19:58:36,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:58:36,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:58:36,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:58:36,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:58:36,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 19:58:36,633 INFO L791 eck$LassoCheckResult]: Stem: 2174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2157#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 2158#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2165#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2181#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2188#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2187#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2164#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2186#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2163#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2160#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2172#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2173#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2161#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2172#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2173#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2161#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2172#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2173#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2161#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2172#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2159#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2162#recFINAL assume true; 2178#recEXIT >#31#return; 2166#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2167#recFINAL assume true; 2208#recEXIT >#31#return; 2206#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2204#recFINAL assume true; 2201#recEXIT >#31#return; 2198#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2197#recFINAL assume true; 2196#recEXIT >#31#return; 2193#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2192#recFINAL assume true; 2191#recEXIT >#31#return; 2183#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2199#recFINAL assume true; 2179#recEXIT >#33#return; 2184#L33-1 [2019-11-15 19:58:36,634 INFO L793 eck$LassoCheckResult]: Loop: 2184#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 2190#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2189#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2180#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2182#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2182#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2182#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2182#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2182#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2185#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2194#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2195#recFINAL assume true; 2210#recEXIT >#31#return; 2209#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2207#recFINAL assume true; 2205#recEXIT >#31#return; 2203#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2202#recFINAL assume true; 2200#recEXIT >#31#return; 2198#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2197#recFINAL assume true; 2196#recEXIT >#31#return; 2193#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2192#recFINAL assume true; 2191#recEXIT >#31#return; 2183#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2199#recFINAL assume true; 2179#recEXIT >#33#return; 2184#L33-1 [2019-11-15 19:58:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -168209085, now seen corresponding path program 3 times [2019-11-15 19:58:36,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:36,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945287237] [2019-11-15 19:58:36,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:36,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:58:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1347159791, now seen corresponding path program 5 times [2019-11-15 19:58:36,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:36,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59505847] [2019-11-15 19:58:36,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:58:36,785 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:58:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:58:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2025501485, now seen corresponding path program 6 times [2019-11-15 19:58:36,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:58:36,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262190752] [2019-11-15 19:58:36,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:58:36,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:58:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:58:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 53 proven. 206 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-15 19:58:37,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262190752] [2019-11-15 19:58:37,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362545504] [2019-11-15 19:58:37,827 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:58:38,055 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 19:58:38,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:58:38,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-15 19:58:38,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:58:38,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 19:58:38,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:38,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:58:38,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:58:38,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 19:58:38,084 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 95 treesize of output 17 [2019-11-15 19:58:38,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:58:38,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:58:38,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:58:38,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-11-15 19:59:23,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:59:23,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:59:23,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-11-15 19:59:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:23,428 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.1 percent of original size [2019-11-15 19:59:23,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:59:23,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:51 [2019-11-15 19:59:23,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:59:23,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:59:23,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2019-11-15 19:59:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:23,562 INFO L567 ElimStorePlain]: treesize reduction 89, result has 43.3 percent of original size [2019-11-15 19:59:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:59:23,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 [2019-11-15 19:59:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:59:23,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:59:23,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:59:23,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 46 [2019-11-15 19:59:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:23,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:23,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:59:23,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 19:59:23,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:23,742 INFO L567 ElimStorePlain]: treesize reduction 20, result has 55.6 percent of original size [2019-11-15 19:59:23,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:59:23,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:271, output treesize:9 [2019-11-15 19:59:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 55 proven. 240 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-15 19:59:23,864 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:59:23,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 39 [2019-11-15 19:59:23,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348875690] [2019-11-15 19:59:24,095 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 19:59:24,431 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-15 19:59:24,859 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 19:59:25,405 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-15 19:59:25,593 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 19:59:25,698 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 19:59:26,115 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2019-11-15 19:59:26,358 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 19:59:26,493 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 19:59:28,055 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 141 DAG size of output: 140 [2019-11-15 19:59:28,427 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 19:59:28,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:59:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 19:59:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1373, Unknown=26, NotChecked=0, Total=1560 [2019-11-15 19:59:28,429 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. cyclomatic complexity: 21 Second operand 40 states. [2019-11-15 19:59:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:59:38,565 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2019-11-15 19:59:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 19:59:38,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 84 transitions. [2019-11-15 19:59:38,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:59:38,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 84 transitions. [2019-11-15 19:59:38,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-11-15 19:59:38,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-11-15 19:59:38,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 84 transitions. [2019-11-15 19:59:38,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:59:38,574 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-11-15 19:59:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 84 transitions. [2019-11-15 19:59:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-15 19:59:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 19:59:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2019-11-15 19:59:38,582 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-11-15 19:59:38,582 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-11-15 19:59:38,582 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 19:59:38,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 84 transitions. [2019-11-15 19:59:38,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 19:59:38,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:59:38,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:59:38,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 19:59:38,585 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:59:38,585 INFO L791 eck$LassoCheckResult]: Stem: 2826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2805#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 2806#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2835#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2817#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2834#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2833#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2815#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2831#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2832#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2808#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2825#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2811#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2809#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2825#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2811#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2809#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2825#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2807#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 2810#recFINAL assume true; 2860#recEXIT >#31#return; 2859#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2857#recFINAL assume true; 2855#recEXIT >#31#return; 2853#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2851#recFINAL assume true; 2849#recEXIT >#31#return; 2848#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2847#recFINAL assume true; 2846#recEXIT >#31#return; 2845#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 2844#recFINAL assume true; 2843#recEXIT >#33#return; 2842#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 2841#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2840#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 2823#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 2821#recENTRY [2019-11-15 19:59:38,585 INFO L793 eck$LassoCheckResult]: Loop: 2821#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 2824#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 2822#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 2821#recENTRY [2019-11-15 19:59:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1112092026, now seen corresponding path program 7 times [2019-11-15 19:59:38,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:38,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659830076] [2019-11-15 19:59:38,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,624 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:59:38,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 3 times [2019-11-15 19:59:38,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:38,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504473210] [2019-11-15 19:59:38,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,630 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:59:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1044174624, now seen corresponding path program 8 times [2019-11-15 19:59:38,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:38,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701585181] [2019-11-15 19:59:38,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:38,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:38,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:59:39,154 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 19:59:39,456 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-15 19:59:40,004 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-15 19:59:40,519 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-11-15 19:59:40,697 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 19:59:44,915 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 212 DAG size of output: 193 [2019-11-15 19:59:45,759 WARN L191 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-15 19:59:46,804 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 146 [2019-11-15 19:59:47,462 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 19:59:47,464 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:59:47,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:59:47,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:59:47,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:59:47,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:59:47,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:59:47,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:59:47,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:59:47,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex9.i_Iteration9_Lasso [2019-11-15 19:59:47,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:59:47,465 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:59:47,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,640 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-15 19:59:47,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:59:47,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 19:59:50,409 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 103 DAG size of output: 103 [2019-11-15 19:59:50,478 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:59:50,478 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:59:50,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:59:50,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:59:50,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:59:50,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,482 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:59:50,482 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:59:50,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:59:50,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:59:50,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,489 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:59:50,489 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:59:50,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,492 INFO L202 nArgumentSynthesizer]: 64 stem disjuncts [2019-11-15 19:59:50,492 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 19:59:50,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,517 INFO L400 nArgumentSynthesizer]: We have 268 Motzkin's Theorem applications. [2019-11-15 19:59:50,517 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 19:59:50,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,668 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:59:50,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:59:50,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:59:50,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:59:50,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:59:50,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:59:50,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:59:50,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:59:50,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:59:50,674 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:59:50,679 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:59:50,691 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 19:59:50,691 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 19:59:50,691 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:59:50,692 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:59:50,692 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:59:50,692 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec_#in~i) = 2*rec_#in~i + 1 Supporting invariants [] [2019-11-15 19:59:50,700 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 19:59:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:59:50,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:50,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:59:50,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:59:50,849 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-11-15 19:59:50,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-15 19:59:50,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27. Second operand 5 states. Result 70 states and 93 transitions. Complement of second has 12 states. [2019-11-15 19:59:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:59:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 19:59:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 19:59:50,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-15 19:59:50,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:59:50,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:59:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:50,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:59:50,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:50,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:59:51,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:59:51,048 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-11-15 19:59:51,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-15 19:59:51,118 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27. Second operand 5 states. Result 70 states and 93 transitions. Complement of second has 12 states. [2019-11-15 19:59:51,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:59:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 19:59:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 19:59:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-15 19:59:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:59:51,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:59:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:59:51,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:51,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:51,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:51,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:51,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:59:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:59:51,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:59:51,292 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-11-15 19:59:51,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-15 19:59:51,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 84 transitions. cyclomatic complexity: 27. Second operand 5 states. Result 108 states and 135 transitions. Complement of second has 13 states. [2019-11-15 19:59:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:59:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 19:59:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-15 19:59:51,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-15 19:59:51,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:59:51,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-15 19:59:51,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:59:51,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-15 19:59:51,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:59:51,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 135 transitions. [2019-11-15 19:59:51,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 19:59:51,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 57 states and 71 transitions. [2019-11-15 19:59:51,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 19:59:51,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-15 19:59:51,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2019-11-15 19:59:51,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:59:51,434 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-11-15 19:59:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2019-11-15 19:59:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2019-11-15 19:59:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 19:59:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-15 19:59:51,438 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 19:59:51,439 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 19:59:51,439 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 19:59:51,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2019-11-15 19:59:51,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 19:59:51,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:59:51,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:59:51,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:59:51,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-15 19:59:51,486 INFO L791 eck$LassoCheckResult]: Stem: 3568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3557#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 3558#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 3581#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 3564#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 3563#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3565#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3556#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3566#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3555#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3551#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3550#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 3553#recFINAL assume true; 3569#recEXIT >#31#return; 3559#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3560#recFINAL assume true; 3591#recEXIT >#31#return; 3590#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3589#recFINAL assume true; 3588#recEXIT >#31#return; 3587#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3586#recFINAL assume true; 3585#recEXIT >#31#return; 3584#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3583#recFINAL assume true; 3582#recEXIT >#31#return; 3576#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3578#recFINAL assume true; 3575#recEXIT >#31#return; 3574#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3573#recFINAL assume true; 3572#recEXIT >#33#return; 3567#L33-1 [2019-11-15 19:59:51,487 INFO L793 eck$LassoCheckResult]: Loop: 3567#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 3561#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 3562#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 3570#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 3580#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3579#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3554#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3577#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 3552#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 3571#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 3550#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 3553#recFINAL assume true; 3569#recEXIT >#31#return; 3559#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3560#recFINAL assume true; 3591#recEXIT >#31#return; 3590#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3589#recFINAL assume true; 3588#recEXIT >#31#return; 3587#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3586#recFINAL assume true; 3585#recEXIT >#31#return; 3584#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3583#recFINAL assume true; 3582#recEXIT >#31#return; 3576#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3578#recFINAL assume true; 3575#recEXIT >#31#return; 3574#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 3573#recFINAL assume true; 3572#recEXIT >#33#return; 3567#L33-1 [2019-11-15 19:59:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash -125673035, now seen corresponding path program 4 times [2019-11-15 19:59:51,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:51,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716458531] [2019-11-15 19:59:51,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:51,527 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:59:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 666530563, now seen corresponding path program 6 times [2019-11-15 19:59:51,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:51,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792671782] [2019-11-15 19:59:51,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:59:51,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:59:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:59:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2013784393, now seen corresponding path program 9 times [2019-11-15 19:59:51,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:59:51,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765704652] [2019-11-15 19:59:51,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:59:51,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:59:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:59:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 73 proven. 285 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-15 19:59:52,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765704652] [2019-11-15 19:59:52,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494167017] [2019-11-15 19:59:52,773 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:59:53,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-15 19:59:53,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:59:53,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 19:59:53,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:59:53,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 19:59:53,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:53,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:59:53,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:59:53,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 19:59:53,209 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 95 treesize of output 17 [2019-11-15 19:59:53,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:59:53,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:59:53,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:59:53,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-11-15 20:00:42,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:00:42,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-11-15 20:00:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:00:42,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:00:42,776 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.0 percent of original size [2019-11-15 20:00:42,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:00:42,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2019-11-15 20:00:42,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:00:42,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2019-11-15 20:00:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:00:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:00:42,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:00:42,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:00:42,940 INFO L567 ElimStorePlain]: treesize reduction 90, result has 40.8 percent of original size [2019-11-15 20:00:42,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:00:42,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2019-11-15 20:00:43,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:00:43,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-11-15 20:00:43,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:00:43,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:00:43,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:00:43,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:122, output treesize:3 [2019-11-15 20:00:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 75 proven. 332 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 20:00:43,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:00:43,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 42 [2019-11-15 20:00:43,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178042279] [2019-11-15 20:00:43,483 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 20:00:43,838 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-11-15 20:00:44,316 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 20:00:44,496 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 20:00:44,602 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 20:00:44,984 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-15 20:00:45,207 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 20:00:45,716 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2019-11-15 20:00:45,830 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 20:00:46,007 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 20:00:46,134 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 20:00:46,609 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2019-11-15 20:00:46,767 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 20:00:46,980 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 20:00:47,180 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 20:00:49,055 WARN L191 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 151 DAG size of output: 150 [2019-11-15 20:00:49,653 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 20:00:49,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:00:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 20:00:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1578, Unknown=34, NotChecked=0, Total=1806 [2019-11-15 20:00:49,655 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. cyclomatic complexity: 8 Second operand 43 states. [2019-11-15 20:05:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:28,492 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2019-11-15 20:05:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 20:05:28,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 104 transitions. [2019-11-15 20:05:28,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:05:28,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 48 states and 57 transitions. [2019-11-15 20:05:28,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 20:05:28,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 20:05:28,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-11-15 20:05:28,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:05:28,496 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-11-15 20:05:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-11-15 20:05:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-15 20:05:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:05:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-15 20:05:28,500 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-15 20:05:28,500 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-15 20:05:28,500 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:05:28,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2019-11-15 20:05:28,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:05:28,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:05:28,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:05:28,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:28,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:28,503 INFO L791 eck$LassoCheckResult]: Stem: 4374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4363#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 4364#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4365#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 4375#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 4376#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4383#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4362#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4371#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4361#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4357#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4356#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 4360#recFINAL assume true; 4377#recEXIT >#31#return; 4366#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4367#recFINAL assume true; 4400#recEXIT >#31#return; 4399#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4398#recFINAL assume true; 4397#recEXIT >#31#return; 4396#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4395#recFINAL assume true; 4394#recEXIT >#31#return; 4393#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4392#recFINAL assume true; 4391#recEXIT >#31#return; 4390#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4389#recFINAL assume true; 4388#recEXIT >#31#return; 4385#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4387#recFINAL assume true; 4384#recEXIT >#31#return; 4382#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4381#recFINAL assume true; 4380#recEXIT >#33#return; 4372#L33-1 [2019-11-15 20:05:28,503 INFO L793 eck$LassoCheckResult]: Loop: 4372#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 4373#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4386#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 4369#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 4368#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4370#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4359#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4379#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 4358#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 4378#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 4356#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 4360#recFINAL assume true; 4377#recEXIT >#31#return; 4366#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4367#recFINAL assume true; 4400#recEXIT >#31#return; 4399#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4398#recFINAL assume true; 4397#recEXIT >#31#return; 4396#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4395#recFINAL assume true; 4394#recEXIT >#31#return; 4393#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4392#recFINAL assume true; 4391#recEXIT >#31#return; 4390#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4389#recFINAL assume true; 4388#recEXIT >#31#return; 4385#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4387#recFINAL assume true; 4384#recEXIT >#31#return; 4382#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 4381#recFINAL assume true; 4380#recEXIT >#33#return; 4372#L33-1 [2019-11-15 20:05:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1055359101, now seen corresponding path program 5 times [2019-11-15 20:05:28,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:28,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291520026] [2019-11-15 20:05:28,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:28,550 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:05:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 241557073, now seen corresponding path program 7 times [2019-11-15 20:05:28,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:28,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927454824] [2019-11-15 20:05:28,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:28,614 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:05:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1444562605, now seen corresponding path program 10 times [2019-11-15 20:05:28,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:28,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159427578] [2019-11-15 20:05:28,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:28,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 96 proven. 377 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 20:05:30,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159427578] [2019-11-15 20:05:30,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431659576] [2019-11-15 20:05:30,022 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:30,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:05:30,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:30,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 20:05:30,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:30,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:30,267 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 95 treesize of output 33 [2019-11-15 20:05:30,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:30,284 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-11-15 20:05:30,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:30,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:21 [2019-11-15 20:05:31,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:31,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 79 [2019-11-15 20:05:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:31,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:31,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:31,968 INFO L567 ElimStorePlain]: treesize reduction 32, result has 64.0 percent of original size [2019-11-15 20:05:31,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:31,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:05:31,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:58 [2019-11-15 20:05:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:05:32,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2019-11-15 20:05:32,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:32,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:32,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 82 [2019-11-15 20:05:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:32,138 INFO L567 ElimStorePlain]: treesize reduction 82, result has 54.7 percent of original size [2019-11-15 20:05:32,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:05:32,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:95 [2019-11-15 20:05:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:32,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:32,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 20:05:32,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:32,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:32,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 20:05:32,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:32,345 INFO L567 ElimStorePlain]: treesize reduction 11, result has 42.1 percent of original size [2019-11-15 20:05:32,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:32,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:259, output treesize:3 [2019-11-15 20:05:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 85 proven. 452 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 20:05:32,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:32,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 44 [2019-11-15 20:05:32,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678215611] [2019-11-15 20:05:32,675 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-15 20:05:32,960 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-15 20:05:33,339 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-15 20:05:33,831 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-11-15 20:05:34,005 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 20:05:34,471 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2019-11-15 20:05:34,691 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 20:05:34,819 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 20:05:35,266 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2019-11-15 20:05:35,398 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 20:05:35,559 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-15 20:05:35,692 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 20:05:36,277 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-11-15 20:05:36,417 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 20:05:36,635 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-15 20:05:36,854 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 20:05:38,749 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 155 DAG size of output: 154 [2019-11-15 20:05:39,635 WARN L191 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-15 20:05:39,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 20:05:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1757, Unknown=1, NotChecked=0, Total=1980 [2019-11-15 20:05:39,636 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 8 Second operand 45 states. [2019-11-15 20:05:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:49,045 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2019-11-15 20:05:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 20:05:49,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 117 transitions. [2019-11-15 20:05:49,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:05:49,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 51 states and 60 transitions. [2019-11-15 20:05:49,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 20:05:49,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 20:05:49,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2019-11-15 20:05:49,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:05:49,049 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 20:05:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2019-11-15 20:05:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-15 20:05:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 20:05:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-11-15 20:05:49,056 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-15 20:05:49,056 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-15 20:05:49,056 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:05:49,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-11-15 20:05:49,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:05:49,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:05:49,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:05:49,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:49,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:49,063 INFO L791 eck$LassoCheckResult]: Stem: 5330#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5320#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem6, main_~pp~0.base, main_~pp~0.offset, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet5; 5321#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 5343#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 5327#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 5326#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5328#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5319#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5329#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5318#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5316#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5313#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 5317#recFINAL assume true; 5333#recEXIT >#31#return; 5324#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5325#recFINAL assume true; 5360#recEXIT >#31#return; 5359#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5358#recFINAL assume true; 5357#recEXIT >#31#return; 5356#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5355#recFINAL assume true; 5354#recEXIT >#31#return; 5353#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5352#recFINAL assume true; 5351#recEXIT >#31#return; 5350#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5349#recFINAL assume true; 5348#recEXIT >#31#return; 5347#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5346#recFINAL assume true; 5345#recEXIT >#31#return; 5340#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5344#recFINAL assume true; 5339#recEXIT >#31#return; 5338#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5337#recFINAL assume true; 5336#recEXIT >#33#return; 5331#L33-1 [2019-11-15 20:05:49,063 INFO L793 eck$LassoCheckResult]: Loop: 5331#L33-1 havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem12 := read~int(main_~pp~0.base, main_~pp~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12; 5322#L29-3 call main_#t~mem6 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 5323#L29-1 assume !!(main_#t~mem6 > 1);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7;call main_#t~mem9 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);call write~int(main_#t~mem9, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~mem9;call write~int(0, main_~qq~0.base, main_~qq~0.offset, 4);call main_#t~mem10 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 5332#L33 call rec(main_~pp~0.base, main_~pp~0.offset, main_#t~mem10);< 5342#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5341#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5314#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5335#L9 assume !(~i < 0);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc1.base, #t~malloc1.offset; 5315#L15 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 5334#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 5313#L9 assume ~i < 0;call write~int(1 + ~i, ~op.base, ~op.offset, 4); 5317#recFINAL assume true; 5333#recEXIT >#31#return; 5324#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5325#recFINAL assume true; 5360#recEXIT >#31#return; 5359#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5358#recFINAL assume true; 5357#recEXIT >#31#return; 5356#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5355#recFINAL assume true; 5354#recEXIT >#31#return; 5353#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5352#recFINAL assume true; 5351#recEXIT >#31#return; 5350#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5349#recFINAL assume true; 5348#recEXIT >#31#return; 5347#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5346#recFINAL assume true; 5345#recEXIT >#31#return; 5340#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5344#recFINAL assume true; 5339#recEXIT >#31#return; 5338#L15-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 5337#recFINAL assume true; 5336#recEXIT >#33#return; 5331#L33-1 [2019-11-15 20:05:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1522933365, now seen corresponding path program 6 times [2019-11-15 20:05:49,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:49,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884450126] [2019-11-15 20:05:49,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:49,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:05:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash -715609405, now seen corresponding path program 8 times [2019-11-15 20:05:49,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:49,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717206092] [2019-11-15 20:05:49,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:05:49,152 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:05:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2042569417, now seen corresponding path program 11 times [2019-11-15 20:05:49,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:49,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632127244] [2019-11-15 20:05:49,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:49,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 122 proven. 482 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-11-15 20:05:50,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632127244] [2019-11-15 20:05:50,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774906905] [2019-11-15 20:05:50,760 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_658dd9db-ea54-4ea7-9214-abcd388e583d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:51,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-11-15 20:05:51,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:51,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-15 20:05:51,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:51,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 20:05:51,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:51,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:51,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:51,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 20:05:51,148 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 95 treesize of output 17 [2019-11-15 20:05:51,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:51,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:51,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:51,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:25 [2019-11-15 20:06:50,875 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_23 Int) (rec_~op.base Int)) (and (< v_prenex_23 0) (= |c_#memory_int| (store |c_old(#memory_int)| rec_~op.base (store (select |c_old(#memory_int)| rec_~op.base) 0 (+ v_prenex_23 1)))) (<= |c_rec_#in~i| (+ v_prenex_23 5)))) is different from true [2019-11-15 20:07:47,878 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_23 Int) (rec_~op.base Int)) (and (< v_prenex_23 0) (= |c_#memory_int| (store |c_old(#memory_int)| rec_~op.base (store (select |c_old(#memory_int)| rec_~op.base) 0 (+ v_prenex_23 1)))) (<= |c_rec_#in~i| (+ v_prenex_23 8)))) is different from true [2019-11-15 20:07:47,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:07:47,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 68 [2019-11-15 20:07:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:47,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:07:47,935 INFO L567 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-11-15 20:07:47,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:47,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:07:47,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-11-15 20:07:47,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:47,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:48,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:07:48,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2019-11-15 20:07:48,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:07:48,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:07:48,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 79 [2019-11-15 20:07:48,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:48,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:48,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:07:48,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:07:48,053 INFO L567 ElimStorePlain]: treesize reduction 182, result has 17.6 percent of original size [2019-11-15 20:07:48,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:07:48,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:39 [2019-11-15 20:07:48,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:07:48,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-11-15 20:07:48,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:07:48,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:07:48,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:07:48,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:132, output treesize:3 [2019-11-15 20:07:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 117 proven. 470 refuted. 7 times theorem prover too weak. 170 trivial. 91 not checked. [2019-11-15 20:07:53,848 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:07:53,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 47 [2019-11-15 20:07:53,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315800599] [2019-11-15 20:07:54,076 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-15 20:07:54,396 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-11-15 20:07:54,617 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 20:07:54,872 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 20:07:55,446 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-15 20:07:55,644 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 20:07:55,747 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 20:07:56,169 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2019-11-15 20:07:56,434 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 20:07:56,589 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 20:07:57,082 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2019-11-15 20:07:57,205 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 20:07:57,383 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-15 20:07:57,561 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 20:07:58,172 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 137 [2019-11-15 20:07:58,333 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 20:07:58,545 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-11-15 20:07:58,768 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-15 20:07:59,598 WARN L191 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 146 [2019-11-15 20:07:59,800 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 20:08:00,126 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-15 20:08:00,429 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-15 20:08:03,329 WARN L191 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 169 DAG size of output: 168 [2019-11-15 20:08:04,172 WARN L191 SmtUtils]: Spent 840.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-15 20:08:04,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 20:08:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1827, Unknown=47, NotChecked=178, Total=2256 [2019-11-15 20:08:04,174 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. cyclomatic complexity: 8 Second operand 48 states. [2019-11-15 20:08:40,114 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-11-15 20:08:42,389 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-11-15 20:08:45,854 WARN L191 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-11-15 20:09:44,269 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-11-15 20:09:44,271 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-11-15 20:09:44,274 INFO L168 Benchmark]: Toolchain (without parser) took 812619.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 876.6 MB in the end (delta: 68.1 MB). Peak memory consumption was 213.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:09:44,275 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:09:44,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:09:44,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.71 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:09:44,275 INFO L168 Benchmark]: Boogie Preprocessor took 48.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:09:44,276 INFO L168 Benchmark]: RCFGBuilder took 326.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:09:44,276 INFO L168 Benchmark]: BuchiAutomizer took 811831.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.9 MB). Free memory was 1.1 GB in the beginning and 876.6 MB in the end (delta: 232.3 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:09:44,278 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.71 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 326.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 811831.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.9 MB). Free memory was 1.1 GB in the beginning and 876.6 MB in the end (delta: 232.3 MB). Peak memory consumption was 240.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...