./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/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 570a3560ecb7b29b974852ea58d8cc903e7c487d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:53:50,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:53:50,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:53:50,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:53:50,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:53:50,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:53:50,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:53:50,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:53:50,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:53:50,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:53:50,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:53:50,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:53:50,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:53:50,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:53:50,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:53:50,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:53:50,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:53:50,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:53:50,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:53:50,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:53:50,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:53:50,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:53:50,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:53:50,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:53:50,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:53:50,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:53:50,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:53:50,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:53:50,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:53:50,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:53:50,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:53:50,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:53:50,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:53:50,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:53:50,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:53:50,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:53:50,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 01:53:50,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:53:50,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:53:50,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:53:50,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:53:50,457 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:53:50,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:53:50,457 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:53:50,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:53:50,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:53:50,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:53:50,459 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:53:50,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:53:50,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:53:50,460 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:53:50,460 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:53:50,460 INFO L133 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_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2018-11-23 01:53:50,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:53:50,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:53:50,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:53:50,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:53:50,492 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:53:50,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-23 01:53:50,528 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/data/94c25973a/2c38b6ff691340c98d9a23caefa29d2b/FLAGc85c5877b [2018-11-23 01:53:50,946 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:53:50,947 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-23 01:53:50,950 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/data/94c25973a/2c38b6ff691340c98d9a23caefa29d2b/FLAGc85c5877b [2018-11-23 01:53:50,959 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/data/94c25973a/2c38b6ff691340c98d9a23caefa29d2b [2018-11-23 01:53:50,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:53:50,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:53:50,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:53:50,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:53:50,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:53:50,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:50" (1/1) ... [2018-11-23 01:53:50,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248de34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:50, skipping insertion in model container [2018-11-23 01:53:50,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:50" (1/1) ... [2018-11-23 01:53:50,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:53:50,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:53:51,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:53:51,111 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:53:51,122 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:53:51,131 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:53:51,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51 WrapperNode [2018-11-23 01:53:51,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:53:51,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:53:51,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:53:51,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:53:51,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:53:51,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:53:51,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:53:51,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:53:51,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... [2018-11-23 01:53:51,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:53:51,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:53:51,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:53:51,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:53:51,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/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 [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 01:53:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:53:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:53:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:53:51,389 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:53:51,390 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 01:53:51,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:51 BoogieIcfgContainer [2018-11-23 01:53:51,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:53:51,390 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:53:51,391 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:53:51,394 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:53:51,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:53:51,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:53:50" (1/3) ... [2018-11-23 01:53:51,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4540b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:53:51, skipping insertion in model container [2018-11-23 01:53:51,395 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:53:51,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:51" (2/3) ... [2018-11-23 01:53:51,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4540b6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:53:51, skipping insertion in model container [2018-11-23 01:53:51,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:53:51,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:51" (3/3) ... [2018-11-23 01:53:51,397 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D_true-termination.c.i [2018-11-23 01:53:51,434 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:53:51,435 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:53:51,435 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:53:51,435 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:53:51,435 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:53:51,435 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:53:51,435 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:53:51,435 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:53:51,435 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:53:51,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:53:51,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 01:53:51,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:51,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:51,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:53:51,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:51,467 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:53:51,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:53:51,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 01:53:51,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:51,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:51,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:53:51,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:51,475 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L30-3true [2018-11-23 01:53:51,475 INFO L796 eck$LassoCheckResult]: Loop: 7#L30-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L30-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 7#L30-3true [2018-11-23 01:53:51,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 01:53:51,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:51,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:51,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-23 01:53:51,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:51,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:51,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:53:51,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:53:51,696 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:53:51,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:53:51,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:53:51,712 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-23 01:53:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:53:51,787 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 01:53:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:53:51,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 01:53:51,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 01:53:51,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-23 01:53:51,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 01:53:51,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 01:53:51,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 01:53:51,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:53:51,800 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 01:53:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 01:53:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 01:53:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 01:53:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 01:53:51,821 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 01:53:51,821 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 01:53:51,821 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:53:51,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-23 01:53:51,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 01:53:51,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:51,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:51,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:53:51,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:51,823 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L30-3 [2018-11-23 01:53:51,823 INFO L796 eck$LassoCheckResult]: Loop: 57#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 63#recFINAL assume true; 65#recEXIT >#42#return; 60#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 61#recFINAL assume true; 66#recEXIT >#44#return; 55#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 57#L30-3 [2018-11-23 01:53:51,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-23 01:53:51,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:51,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:51,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:51,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-23 01:53:51,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:53:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-23 01:53:51,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:52,255 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-23 01:53:52,758 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2018-11-23 01:53:52,886 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:53:52,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:53:52,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:53:52,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:53:52,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:53:52,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:53:52,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:53:52,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:53:52,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration2_Lasso [2018-11-23 01:53:52,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:53:52,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:53:52,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:52,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:53,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:53,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:53,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:53,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:53,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:53:53,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:53:53,240 INFO L122 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 [2018-11-23 01:53:53,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:53,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:53,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:53,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,246 INFO L122 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 [2018-11-23 01:53:53,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:53,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:53,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,251 INFO L122 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 [2018-11-23 01:53:53,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:53,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:53,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:53,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,253 INFO L122 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 [2018-11-23 01:53:53,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:53,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:53,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:53,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,255 INFO L122 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 [2018-11-23 01:53:53,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:53,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:53,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,260 INFO L122 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 [2018-11-23 01:53:53,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:53,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:53,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:53,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,262 INFO L122 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 [2018-11-23 01:53:53,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:53,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:53,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,279 INFO L122 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 [2018-11-23 01:53:53,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:53,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:53,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,293 INFO L122 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 [2018-11-23 01:53:53,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:53,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:53,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:53,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:53,297 INFO L122 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 [2018-11-23 01:53:53,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:53,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:53,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:53,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:53,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:53,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:53,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:53:53,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 01:53:53,317 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 01:53:53,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:53:53,320 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:53:53,320 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:53:53,321 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-23 01:53:53,335 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 01:53:53,340 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:53:53,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:53,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:53,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:53,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:53,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:53,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:53:53,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,466 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 01:53:53,468 INFO L478 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 8 treesize of output 7 [2018-11-23 01:53:53,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,488 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-23 01:53:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 01:53:53,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 01:53:53,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:53,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-23 01:53:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 01:53:53,548 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 01:53:53,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 01:53:53,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-23 01:53:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 01:53:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 01:53:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-23 01:53:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-23 01:53:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-23 01:53:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-23 01:53:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:53,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-23 01:53:53,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 01:53:53,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-23 01:53:53,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-23 01:53:53,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 01:53:53,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-23 01:53:53,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:53:53,640 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 01:53:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-23 01:53:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-23 01:53:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 01:53:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-23 01:53:53,643 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 01:53:53,644 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 01:53:53,644 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:53:53,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-23 01:53:53,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 01:53:53,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:53,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:53,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:53,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 01:53:53,645 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 274#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 288#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 01:53:53,645 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 01:53:53,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-23 01:53:53,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:53,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-23 01:53:53,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:53,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:53,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-23 01:53:53,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:53,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:53,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:53,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:54,115 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-23 01:53:54,359 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2018-11-23 01:53:54,401 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:53:54,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:53:54,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:53:54,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:53:54,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:53:54,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:53:54,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:53:54,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:53:54,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration3_Lasso [2018-11-23 01:53:54,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:53:54,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:53:54,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:54,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:53:54,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:53:54,677 INFO L122 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 [2018-11-23 01:53:54,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,680 INFO L122 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 [2018-11-23 01:53:54,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,685 INFO L122 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 [2018-11-23 01:53:54,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,687 INFO L122 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 [2018-11-23 01:53:54,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,688 INFO L122 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 [2018-11-23 01:53:54,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,689 INFO L122 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 [2018-11-23 01:53:54,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,691 INFO L122 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 [2018-11-23 01:53:54,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,693 INFO L122 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 [2018-11-23 01:53:54,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,695 INFO L122 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 [2018-11-23 01:53:54,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:54,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:54,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,698 INFO L122 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 [2018-11-23 01:53:54,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,700 INFO L122 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 [2018-11-23 01:53:54,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,702 INFO L122 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 [2018-11-23 01:53:54,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,703 INFO L122 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 [2018-11-23 01:53:54,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,705 INFO L122 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 [2018-11-23 01:53:54,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,707 INFO L122 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 [2018-11-23 01:53:54,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,709 INFO L122 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 [2018-11-23 01:53:54,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,711 INFO L122 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 [2018-11-23 01:53:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,713 INFO L122 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 [2018-11-23 01:53:54,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,714 INFO L122 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 [2018-11-23 01:53:54,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,716 INFO L122 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 [2018-11-23 01:53:54,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:54,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:54,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,718 INFO L122 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 [2018-11-23 01:53:54,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:54,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:54,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,721 INFO L122 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 [2018-11-23 01:53:54,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:54,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:54,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:54,729 INFO L122 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 [2018-11-23 01:53:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:54,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:54,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:54,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:54,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:53:54,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 01:53:54,742 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 01:53:54,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:53:54,743 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:53:54,744 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:53:54,744 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-23 01:53:54,750 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 01:53:54,753 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:53:54,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:54,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:54,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:54,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 01:53:54,829 INFO L478 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 37 treesize of output 36 [2018-11-23 01:53:54,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:54,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:54,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 01:53:54,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:53:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:53:54,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:53:54,886 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 01:53:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:54,907 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 [2018-11-23 01:53:54,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 01:53:54,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-23 01:53:54,962 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 [2018-11-23 01:53:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 01:53:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 01:53:54,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 01:53:54,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:54,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 01:53:54,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:54,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 01:53:54,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:54,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-23 01:53:54,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 01:53:54,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-23 01:53:54,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 01:53:54,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 01:53:54,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-23 01:53:54,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:53:54,969 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-23 01:53:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-23 01:53:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-23 01:53:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 01:53:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-23 01:53:54,975 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 01:53:54,975 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 01:53:54,975 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:53:54,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-23 01:53:54,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 01:53:54,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:54,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:54,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:54,978 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:54,978 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 500#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 477#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 479#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 544#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 542#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 541#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 488#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 540#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 548#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 547#recFINAL assume true; 530#recEXIT >#42#return; 527#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 525#recFINAL assume true; 518#recEXIT >#44#return; 473#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 474#L38-3 [2018-11-23 01:53:54,978 INFO L796 eck$LassoCheckResult]: Loop: 474#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 509#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 526#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 524#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 505#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 506#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 504#recFINAL assume true; 507#recEXIT >#42#return; 516#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 522#recFINAL assume true; 515#recEXIT >#44#return; 513#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 474#L38-3 [2018-11-23 01:53:54,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-23 01:53:54,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:54,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:54,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:53:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:55,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:53:55,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fd6fffd-93f8-42be-91b5-25b9b1ff454d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:53:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:55,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:55,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 01:53:55,142 INFO L478 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 26 treesize of output 25 [2018-11-23 01:53:55,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:55,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:55,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 01:53:55,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:53:55,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:53:55,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:53:55,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-23 01:53:55,218 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 01:53:55,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:55,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 01:53:55,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 01:53:55,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:55,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:55,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:53:55,227 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-23 01:53:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:55,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:53:55,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 01:53:55,259 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 01:53:55,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:55,259 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-23 01:53:55,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:53:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:55,477 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-23 01:53:55,818 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2018-11-23 01:53:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:53:55,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:53:55,894 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-23 01:53:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:53:55,960 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 01:53:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:53:55,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-23 01:53:55,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:53:55,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-23 01:53:55,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 01:53:55,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 01:53:55,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-23 01:53:55,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:53:55,963 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 01:53:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-23 01:53:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 01:53:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 01:53:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 01:53:55,966 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 01:53:55,966 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 01:53:55,966 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 01:53:55,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-23 01:53:55,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 01:53:55,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:53:55,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:53:55,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:53:55,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 01:53:55,967 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 711#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 712#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 731#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 732#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 743#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 721#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 738#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 725#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 726#recFINAL assume true; 729#recEXIT >#42#return; 730#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 735#recFINAL assume true; 734#recEXIT >#44#return; 702#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 703#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ite13;havoc main_#t~mem14;havoc main_#t~ret12; 713#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 715#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 718#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 705#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 704#recENTRY [2018-11-23 01:53:55,967 INFO L796 eck$LassoCheckResult]: Loop: 704#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 704#recENTRY [2018-11-23 01:53:55,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-23 01:53:55,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:53:55,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:55,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-23 01:53:55,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:55,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:53:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-23 01:53:56,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:53:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:53:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:56,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:53:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:53:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:53:56,348 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-23 01:53:57,141 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 186 [2018-11-23 01:53:57,284 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 01:53:57,438 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-23 01:53:57,555 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 01:53:57,556 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:53:57,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:53:57,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:53:57,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:53:57,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:53:57,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:53:57,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:53:57,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:53:57,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration5_Lasso [2018-11-23 01:53:57,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:53:57,557 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:53:57,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:53:57,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:53:57,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:53:57,888 INFO L122 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 [2018-11-23 01:53:57,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,890 INFO L122 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 [2018-11-23 01:53:57,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,891 INFO L122 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 [2018-11-23 01:53:57,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,892 INFO L122 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 [2018-11-23 01:53:57,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,894 INFO L122 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 [2018-11-23 01:53:57,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,896 INFO L122 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 [2018-11-23 01:53:57,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,898 INFO L122 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 [2018-11-23 01:53:57,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,900 INFO L122 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 [2018-11-23 01:53:57,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,902 INFO L122 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 [2018-11-23 01:53:57,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,903 INFO L122 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 [2018-11-23 01:53:57,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,906 INFO L122 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 [2018-11-23 01:53:57,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,907 INFO L122 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 [2018-11-23 01:53:57,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,909 INFO L122 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 [2018-11-23 01:53:57,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,910 INFO L122 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 [2018-11-23 01:53:57,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,912 INFO L122 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 [2018-11-23 01:53:57,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,913 INFO L122 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 [2018-11-23 01:53:57,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,915 INFO L122 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 [2018-11-23 01:53:57,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:53:57,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:53:57,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:53:57,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,917 INFO L122 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 [2018-11-23 01:53:57,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,919 INFO L122 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 [2018-11-23 01:53:57,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,924 INFO L122 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 [2018-11-23 01:53:57,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,927 INFO L122 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 [2018-11-23 01:53:57,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,934 INFO L122 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 [2018-11-23 01:53:57,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,934 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 01:53:57,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,935 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 01:53:57,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:53:57,937 INFO L122 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 [2018-11-23 01:53:57,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:53:57,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:53:57,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:53:57,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:53:57,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:53:57,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:53:57,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:53:57,953 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 01:53:57,954 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 01:53:57,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:53:57,955 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:53:57,955 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:53:57,955 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-23 01:53:57,994 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 01:53:57,997 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 01:53:58,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 01:53:58,080 INFO L478 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 37 treesize of output 36 [2018-11-23 01:53:58,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:58,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:58,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 01:53:58,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:53:58,135 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 01:53:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:58,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 01:53:58,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 01:53:58,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-23 01:53:58,227 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 [2018-11-23 01:53:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 01:53:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 01:53:58,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 01:53:58,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:58,228 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 01:53:58,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 01:53:58,325 INFO L478 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 37 treesize of output 36 [2018-11-23 01:53:58,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:58,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:58,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 01:53:58,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:53:58,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 01:53:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:58,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 01:53:58,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 01:53:58,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2018-11-23 01:53:58,442 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 [2018-11-23 01:53:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 01:53:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-23 01:53:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 01:53:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:58,443 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 01:53:58,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:53:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:53:58,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:53:58,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 01:53:58,540 INFO L478 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 37 treesize of output 36 [2018-11-23 01:53:58,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:53:58,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:53:58,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-23 01:53:58,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:53:58,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:53:58,585 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 01:53:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:53:58,598 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 01:53:58,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 01:53:58,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2018-11-23 01:53:58,650 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 [2018-11-23 01:53:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 01:53:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 01:53:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 01:53:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-23 01:53:58,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:58,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 01:53:58,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:53:58,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-23 01:53:58,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:53:58,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-23 01:53:58,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 01:53:58,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 01:53:58,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 01:53:58,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:53:58,653 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:53:58,653 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:53:58,654 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:53:58,654 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 01:53:58,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:53:58,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:53:58,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 01:53:58,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:53:58 BoogieIcfgContainer [2018-11-23 01:53:58,658 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:53:58,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:53:58,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:53:58,659 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:53:58,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:53:51" (3/4) ... [2018-11-23 01:53:58,662 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:53:58,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:53:58,662 INFO L168 Benchmark]: Toolchain (without parser) took 7700.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 958.2 MB in the beginning and 1.3 GB in the end (delta: -369.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,663 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:53:58,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,664 INFO L168 Benchmark]: Boogie Preprocessor took 57.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,664 INFO L168 Benchmark]: RCFGBuilder took 179.56 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,664 INFO L168 Benchmark]: BuchiAutomizer took 7267.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:53:58,665 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:53:58,667 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.85 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.56 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7267.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 58 SDslu, 139 SDs, 0 SdLazy, 254 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital370 mio100 ax100 hnf100 lsp97 ukn37 mio100 lsp31 div100 bol100 ite100 ukn100 eq177 hnf89 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...