./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/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 205669a0469477740fa35099dd0e4ee1e635b686 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:53,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:53,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:53,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:53,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:53,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:53,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:53,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:53,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:53,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:53,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:53,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:53,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:53,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:53,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:53,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:53,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:53,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:53,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:53,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:53,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:53,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:53,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:53,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:53,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:53,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:53,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:53,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:53,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:53,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:53,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:53,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:53,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:53,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:53,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:53,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:53,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:53,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:53,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:53,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:53,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:53,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:53,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:53,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:53,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:53,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:53,461 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:53,462 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:53,462 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:53,462 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:53,462 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:53,462 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:53,462 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:53,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:53,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:53,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:53,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:53,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:53,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:53,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:53,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:53,465 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:53,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:53,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:53,466 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:53,467 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:53,467 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2019-10-22 08:58:53,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:53,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:53,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:53,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:53,507 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:53,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-10-22 08:58:53,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/data/3145d74d6/31b4c22d7b09414a83991e7703e7bc18/FLAG58aa0f3f9 [2019-10-22 08:58:53,939 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:53,939 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-10-22 08:58:53,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/data/3145d74d6/31b4c22d7b09414a83991e7703e7bc18/FLAG58aa0f3f9 [2019-10-22 08:58:53,955 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/data/3145d74d6/31b4c22d7b09414a83991e7703e7bc18 [2019-10-22 08:58:53,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:53,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:53,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:53,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:53,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:53,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4debb188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:53, skipping insertion in model container [2019-10-22 08:58:53,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:53" (1/1) ... [2019-10-22 08:58:53,974 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:53,988 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:54,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:54,135 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:54,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:54,223 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:54,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54 WrapperNode [2019-10-22 08:58:54,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:54,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:54,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:54,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:54,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:54,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:54,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:54,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:54,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... [2019-10-22 08:58:54,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:54,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:54,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:54,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:54,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-10-22 08:58:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-10-22 08:58:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:54,581 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:54,582 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:58:54,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54 BoogieIcfgContainer [2019-10-22 08:58:54,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:54,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:54,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:54,586 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:54,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:53" (1/3) ... [2019-10-22 08:58:54,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c08d62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:54, skipping insertion in model container [2019-10-22 08:58:54,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:54" (2/3) ... [2019-10-22 08:58:54,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c08d62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:54, skipping insertion in model container [2019-10-22 08:58:54,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:54,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54" (3/3) ... [2019-10-22 08:58:54,591 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2019-10-22 08:58:54,662 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:54,662 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:54,662 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:54,662 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:54,663 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:54,663 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:54,663 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:54,663 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:54,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:58:54,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:54,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:54,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:54,712 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:54,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:58:54,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:54,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,714 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:54,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:54,721 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2019-10-22 08:58:54,721 INFO L793 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 7#L23-3true [2019-10-22 08:58:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-10-22 08:58:54,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597709380] [2019-10-22 08:58:54,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2019-10-22 08:58:54,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131146067] [2019-10-22 08:58:54,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131146067] [2019-10-22 08:58:55,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:55,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:55,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767273631] [2019-10-22 08:58:55,038 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:55,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:55,054 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-10-22 08:58:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:55,163 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-10-22 08:58:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:55,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-10-22 08:58:55,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:55,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2019-10-22 08:58:55,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:58:55,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:58:55,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-10-22 08:58:55,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:55,178 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:58:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-10-22 08:58:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:58:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:58:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-10-22 08:58:55,208 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:58:55,208 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:58:55,208 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:55,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-10-22 08:58:55,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:55,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:55,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:55,210 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:55,210 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:55,210 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 52#L23-3 [2019-10-22 08:58:55,210 INFO L793 eck$LassoCheckResult]: Loop: 52#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 59#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 54#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 55#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 56#recFINAL assume true; 60#recEXIT >#29#return; 61#L17-1 #res := #t~ret6;havoc #t~ret6; 62#recFINAL assume true; 64#recEXIT >#31#return; 63#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 52#L23-3 [2019-10-22 08:58:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-10-22 08:58:55,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539376943] [2019-10-22 08:58:55,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,234 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,234 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2019-10-22 08:58:55,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041454690] [2019-10-22 08:58:55,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:58:55,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041454690] [2019-10-22 08:58:55,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26304056] [2019-10-22 08:58:55,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,677 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-10-22 08:58:55,677 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 23 treesize of output 18 [2019-10-22 08:58:55,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:55,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:55,685 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-10-22 08:58:55,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-22 08:58:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:55,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:55,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-22 08:58:55,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740717972] [2019-10-22 08:58:55,860 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:55,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:58:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:58:55,861 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-10-22 08:58:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,063 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-10-22 08:58:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:56,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-10-22 08:58:56,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:56,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-10-22 08:58:56,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:58:56,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:58:56,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-10-22 08:58:56,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:56,067 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:58:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-10-22 08:58:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:58:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:58:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-22 08:58:56,072 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:58:56,072 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:58:56,072 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:56,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-10-22 08:58:56,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:56,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:56,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:56,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:56,074 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:56,074 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 160#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 161#L23-3 [2019-10-22 08:58:56,074 INFO L793 eck$LassoCheckResult]: Loop: 161#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 168#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 163#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 165#recFINAL assume true; 169#recEXIT >#29#return; 170#L17-1 #res := #t~ret6;havoc #t~ret6; 171#recFINAL assume true; 176#recEXIT >#29#return; 174#L17-1 #res := #t~ret6;havoc #t~ret6; 175#recFINAL assume true; 173#recEXIT >#31#return; 172#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 161#L23-3 [2019-10-22 08:58:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-10-22 08:58:56,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210843931] [2019-10-22 08:58:56,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,097 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2019-10-22 08:58:56,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187387104] [2019-10-22 08:58:56,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 08:58:56,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187387104] [2019-10-22 08:58:56,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615698524] [2019-10-22 08:58:56,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/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-10-22 08:58:56,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:56,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:56,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,567 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-10-22 08:58:56,568 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 23 treesize of output 18 [2019-10-22 08:58:56,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:56,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:56,576 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-10-22 08:58:56,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-10-22 08:58:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:58:56,749 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:56,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-10-22 08:58:56,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535564250] [2019-10-22 08:58:56,750 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:56,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:58:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:58:56,751 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-10-22 08:58:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,966 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-22 08:58:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:58:56,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-10-22 08:58:56,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:56,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-10-22 08:58:56,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:58:56,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:58:56,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-10-22 08:58:56,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:56,970 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-22 08:58:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-10-22 08:58:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:58:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:58:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-22 08:58:56,975 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-22 08:58:56,975 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-22 08:58:56,975 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:56,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-10-22 08:58:56,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:58:56,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:56,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:56,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:56,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:56,980 INFO L791 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 317#L23-3 [2019-10-22 08:58:56,980 INFO L793 eck$LassoCheckResult]: Loop: 317#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 320#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 313#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 315#recFINAL assume true; 331#recEXIT >#29#return; 324#L17-1 #res := #t~ret6;havoc #t~ret6; 323#recFINAL assume true; 321#recEXIT >#29#return; 322#L17-1 #res := #t~ret6;havoc #t~ret6; 330#recFINAL assume true; 329#recEXIT >#29#return; 327#L17-1 #res := #t~ret6;havoc #t~ret6; 328#recFINAL assume true; 326#recEXIT >#31#return; 325#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 317#L23-3 [2019-10-22 08:58:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-10-22 08:58:56,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75767251] [2019-10-22 08:58:56,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,995 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2019-10-22 08:58:56,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570087395] [2019-10-22 08:58:56,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2019-10-22 08:58:57,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678374082] [2019-10-22 08:58:57,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,598 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-22 08:58:58,098 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-10-22 08:58:58,368 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 08:58:58,792 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-10-22 08:58:58,973 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-22 08:58:59,545 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-10-22 08:58:59,658 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:58:59,728 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:59,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:59,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:59,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:59,729 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:59,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:59,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:59,729 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:59,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2019-10-22 08:58:59,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:59,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:59,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,977 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-22 08:58:59,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:59,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:00,597 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-22 08:59:00,639 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:00,644 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:00,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,654 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,659 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:00,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:00,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,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-10-22 08:59:00,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,674 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:00,674 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:00,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:00,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:00,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:00,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:00,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:00,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:00,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:00,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:00,690 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:00,690 INFO L203 nArgumentSynthesizer]: 16 loop disjuncts [2019-10-22 08:59:00,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:00,900 INFO L400 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2019-10-22 08:59:00,900 INFO L401 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2019-10-22 08:59:02,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:02,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:02,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:02,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:02,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:02,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:02,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:02,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:02,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:02,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:02,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:02,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:02,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:02,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:02,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:02,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:02,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:02,827 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:02,855 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:02,864 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:02,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:02,867 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:02,867 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:02,868 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2019-10-22 08:59:02,887 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:02,893 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:02,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-22 08:59:02,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:02,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:02,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:59:02,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:03,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:03,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:59:03,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 08:59:03,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:03,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:03,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:03,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-10-22 08:59:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 08:59:03,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-10-22 08:59:03,157 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-10-22 08:59:03,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2019-10-22 08:59:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:59:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-10-22 08:59:03,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2019-10-22 08:59:03,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:03,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2019-10-22 08:59:03,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:03,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2019-10-22 08:59:03,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:03,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2019-10-22 08:59:03,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:03,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2019-10-22 08:59:03,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:03,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:03,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-10-22 08:59:03,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:03,319 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-22 08:59:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-10-22 08:59:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-22 08:59:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:59:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-22 08:59:03,326 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 08:59:03,326 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 08:59:03,326 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:03,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-10-22 08:59:03,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:03,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:03,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:03,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:03,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:03,328 INFO L791 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 547#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 548#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 561#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 550#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 556#recENTRY [2019-10-22 08:59:03,328 INFO L793 eck$LassoCheckResult]: Loop: 556#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 551#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 556#recENTRY [2019-10-22 08:59:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2019-10-22 08:59:03,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638697884] [2019-10-22 08:59:03,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2019-10-22 08:59:03,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46138686] [2019-10-22 08:59:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,354 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2019-10-22 08:59:03,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574876140] [2019-10-22 08:59:03,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:03,372 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:03,512 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-22 08:59:03,800 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-22 08:59:04,093 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-10-22 08:59:04,319 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:04,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:04,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:04,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:04,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:04,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:04,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:04,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:04,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2019-10-22 08:59:04,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:04,320 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:04,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,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-10-22 08:59:04,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-10-22 08:59:04,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-10-22 08:59:04,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,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-10-22 08:59:04,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:04,876 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:04,876 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:04,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,886 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,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-10-22 08:59:04,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,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-10-22 08:59:04,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:04,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:04,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:04,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,910 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,910 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:04,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:04,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:04,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:04,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:04,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:04,918 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:04,918 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:04,930 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:04,936 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:04,936 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:04,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:04,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:04,937 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:04,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-10-22 08:59:04,946 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:04,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-10-22 08:59:05,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-22 08:59:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:05,026 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:05,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:59:05,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2019-10-22 08:59:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:59:05,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:59:05,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:59:05,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:59:05,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:05,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-10-22 08:59:05,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-10-22 08:59:05,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:05,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:05,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-10-22 08:59:05,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:05,101 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-10-22 08:59:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 08:59:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:59:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-22 08:59:05,105 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:05,106 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 08:59:05,106 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:05,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-10-22 08:59:05,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:05,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:05,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:05,107 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,107 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:05,108 INFO L791 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 710#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 711#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 727#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 729#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 743#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 742#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 722#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 736#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 737#recFINAL assume true; 741#recEXIT >#29#return; 719#L17-1 #res := #t~ret6;havoc #t~ret6; 724#recFINAL assume true; 735#recEXIT >#29#return; 733#L17-1 #res := #t~ret6;havoc #t~ret6; 734#recFINAL assume true; 732#recEXIT >#29#return; 731#L17-1 #res := #t~ret6;havoc #t~ret6; 730#recFINAL assume true; 728#recEXIT >#31#return; 725#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 726#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 715#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 706#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 712#recENTRY [2019-10-22 08:59:05,108 INFO L793 eck$LassoCheckResult]: Loop: 712#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 704#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 705#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 712#recENTRY [2019-10-22 08:59:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2019-10-22 08:59:05,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185778228] [2019-10-22 08:59:05,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 08:59:05,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185778228] [2019-10-22 08:59:05,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626509216] [2019-10-22 08:59:05,438 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a9ab5e-a7c6-40b7-a1dc-a404b1ef2e63/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-10-22 08:59:05,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:59:05,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:59:05,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-22 08:59:05,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,583 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-10-22 08:59:05,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-22 08:59:05,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2019-10-22 08:59:05,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:59:05,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,623 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 15 treesize of output 15 [2019-10-22 08:59:05,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:05,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:05,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-10-22 08:59:06,002 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 36 treesize of output 23 [2019-10-22 08:59:06,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,012 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-10-22 08:59:06,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2019-10-22 08:59:06,071 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 50 treesize of output 33 [2019-10-22 08:59:06,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:06,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:06,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2019-10-22 08:59:06,127 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-10-22 08:59:06,128 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:06,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:06,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:06,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:14 [2019-10-22 08:59:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 08:59:06,157 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:06,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-10-22 08:59:06,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269107394] [2019-10-22 08:59:06,158 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2019-10-22 08:59:06,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12388920] [2019-10-22 08:59:06,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,168 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:06,276 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-22 08:59:06,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-22 08:59:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-10-22 08:59:06,408 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 32 states. [2019-10-22 08:59:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:06,822 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-22 08:59:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:59:06,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-10-22 08:59:06,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:06,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-10-22 08:59:06,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:06,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:06,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-10-22 08:59:06,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:06,827 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-10-22 08:59:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-10-22 08:59:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-22 08:59:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-22 08:59:06,833 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-22 08:59:06,833 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-22 08:59:06,833 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:06,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-10-22 08:59:06,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:06,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:06,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:06,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:59:06,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:06,835 INFO L791 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 995#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 996#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1006#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 998#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 999#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1021#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 992#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 991#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 994#recFINAL assume true; 1009#recEXIT >#29#return; 1010#L17-1 #res := #t~ret6;havoc #t~ret6; 1011#recFINAL assume true; 1007#recEXIT >#29#return; 1008#L17-1 #res := #t~ret6;havoc #t~ret6; 1026#recFINAL assume true; 1024#recEXIT >#29#return; 1020#L17-1 #res := #t~ret6;havoc #t~ret6; 1022#recFINAL assume true; 1019#recEXIT >#29#return; 1018#L17-1 #res := #t~ret6;havoc #t~ret6; 1017#recFINAL assume true; 1015#recEXIT >#31#return; 1012#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 1013#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1005#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 990#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 997#recENTRY [2019-10-22 08:59:06,836 INFO L793 eck$LassoCheckResult]: Loop: 997#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 988#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 989#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 997#recENTRY [2019-10-22 08:59:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2019-10-22 08:59:06,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915174784] [2019-10-22 08:59:06,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2019-10-22 08:59:06,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836834503] [2019-10-22 08:59:06,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2019-10-22 08:59:06,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:06,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468846566] [2019-10-22 08:59:06,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:06,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:06,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,106 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-22 08:59:07,615 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-22 08:59:08,257 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-10-22 08:59:08,814 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-10-22 08:59:09,468 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-10-22 08:59:09,582 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 08:59:09,813 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-22 08:59:11,256 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 242 DAG size of output: 209 [2019-10-22 08:59:11,689 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-10-22 08:59:11,995 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-10-22 08:59:12,207 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-10-22 08:59:12,210 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:12,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:12,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:12,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:12,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:12,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:12,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:12,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:12,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2019-10-22 08:59:12,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:12,211 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,486 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-10-22 08:59:12,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:12,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-10-22 08:59:18,231 WARN L191 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 173 DAG size of output: 173 [2019-10-22 08:59:18,329 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:18,330 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:18,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,338 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,340 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,341 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,341 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,358 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,379 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,382 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,383 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,384 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,385 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,394 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,394 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,397 INFO L202 nArgumentSynthesizer]: 128 stem disjuncts [2019-10-22 08:59:18,397 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:18,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,438 INFO L400 nArgumentSynthesizer]: We have 524 Motzkin's Theorem applications. [2019-10-22 08:59:18,438 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:18,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:18,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,758 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,758 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,771 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:18,778 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:18,778 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:18,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:18,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:18,779 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:18,779 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) 0)_1 + 1 Supporting invariants [] [2019-10-22 08:59:18,798 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:59:18,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,960 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 1 case distinctions, treesize of input 36 treesize of output 32 [2019-10-22 08:59:18,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,970 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-10-22 08:59:18,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-10-22 08:59:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:18,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-10-22 08:59:18,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-10-22 08:59:19,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-10-22 08:59:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:59:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-10-22 08:59:19,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-10-22 08:59:19,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,056 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:19,197 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 1 case distinctions, treesize of input 36 treesize of output 32 [2019-10-22 08:59:19,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,205 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-10-22 08:59:19,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-10-22 08:59:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:19,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2019-10-22 08:59:19,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-10-22 08:59:19,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-10-22 08:59:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:59:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-10-22 08:59:19,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-10-22 08:59:19,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,305 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:19,476 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 1 case distinctions, treesize of input 36 treesize of output 32 [2019-10-22 08:59:19,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,484 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-10-22 08:59:19,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-10-22 08:59:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:19,497 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-10-22 08:59:19,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-10-22 08:59:19,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 63 states and 72 transitions. Complement of second has 16 states. [2019-10-22 08:59:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:59:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-10-22 08:59:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 3 letters. [2019-10-22 08:59:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 40 letters. Loop has 3 letters. [2019-10-22 08:59:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 6 letters. [2019-10-22 08:59:19,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-10-22 08:59:19,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:19,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2019-10-22 08:59:19,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:19,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:19,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:19,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:19,602 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,602 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,602 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,602 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:19,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:19,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:19,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:19,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:19 BoogieIcfgContainer [2019-10-22 08:59:19,608 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:19,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:19,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:19,609 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:19,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:54" (3/4) ... [2019-10-22 08:59:19,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:19,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:19,614 INFO L168 Benchmark]: Toolchain (without parser) took 25655.10 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 664.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 516.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,614 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,615 INFO L168 Benchmark]: Boogie Preprocessor took 20.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,615 INFO L168 Benchmark]: RCFGBuilder took 306.42 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,616 INFO L168 Benchmark]: BuchiAutomizer took 25025.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 543.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,616 INFO L168 Benchmark]: Witness Printer took 4.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,618 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.35 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 306.42 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25025.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 543.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][0] + 1 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.9s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 22.4s. Construction of modules took 0.6s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 84 SDtfs, 58 SDslu, 256 SDs, 0 SdLazy, 624 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp29 div100 bol100 ite100 ukn100 eq181 hnf91 smp100 dnf2287 smp86 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2103ms VariablesStem: 3 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...