./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2618f63f0acd986074ff563fe806d4dc698d3d84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:13:13,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:13:13,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:13:13,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:13:13,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:13:13,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:13:13,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:13:13,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:13:13,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:13:13,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:13:13,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:13:13,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:13:13,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:13:13,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:13:13,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:13:13,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:13:13,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:13:13,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:13:13,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:13:13,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:13:13,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:13:13,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:13:13,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:13:13,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:13:13,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:13:13,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:13:13,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:13:13,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:13:13,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:13:13,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:13:13,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:13:13,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:13:13,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:13:13,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:13:13,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:13:13,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:13:13,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:13:13,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:13:13,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:13:13,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:13:13,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:13:13,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:13:13,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:13:13,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:13:13,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:13:13,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:13:13,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:13:13,380 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:13:13,380 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:13:13,381 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:13:13,381 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:13:13,381 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:13:13,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:13:13,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:13:13,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:13:13,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:13:13,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:13:13,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:13:13,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:13:13,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:13:13,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:13:13,386 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:13:13,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:13:13,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:13:13,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:13:13,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:13:13,388 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:13:13,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:13:13,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:13:13,389 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:13:13,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:13:13,390 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2618f63f0acd986074ff563fe806d4dc698d3d84 [2019-11-15 22:13:13,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:13:13,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:13:13,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:13:13,461 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:13:13,461 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:13:13,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i [2019-11-15 22:13:13,531 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/data/0450cc073/7fbb64a160c64e62a26145aa13a765f3/FLAGf4d7cf892 [2019-11-15 22:13:14,014 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:13:14,015 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i [2019-11-15 22:13:14,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/data/0450cc073/7fbb64a160c64e62a26145aa13a765f3/FLAGf4d7cf892 [2019-11-15 22:13:14,295 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/data/0450cc073/7fbb64a160c64e62a26145aa13a765f3 [2019-11-15 22:13:14,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:13:14,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:13:14,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:14,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:13:14,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:13:14,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:14,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46020af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14, skipping insertion in model container [2019-11-15 22:13:14,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:14,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:13:14,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:13:14,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:14,855 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:13:14,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:14,977 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:13:14,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14 WrapperNode [2019-11-15 22:13:14,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:14,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:14,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:13:14,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:13:14,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:15,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:13:15,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:13:15,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:13:15,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... [2019-11-15 22:13:15,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:13:15,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:13:15,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:13:15,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:13:15,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:13:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:13:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:13:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:13:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:13:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:13:15,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:13:15,566 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:13:15,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:15 BoogieIcfgContainer [2019-11-15 22:13:15,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:13:15,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:13:15,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:13:15,572 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:13:15,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:15,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:13:14" (1/3) ... [2019-11-15 22:13:15,574 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484d9a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:13:15, skipping insertion in model container [2019-11-15 22:13:15,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:15,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:14" (2/3) ... [2019-11-15 22:13:15,575 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@484d9a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:13:15, skipping insertion in model container [2019-11-15 22:13:15,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:15,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:15" (3/3) ... [2019-11-15 22:13:15,577 INFO L371 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca.i [2019-11-15 22:13:15,638 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:13:15,639 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:13:15,639 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:13:15,639 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:13:15,639 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:13:15,639 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:13:15,640 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:13:15,640 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:13:15,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-15 22:13:15,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:15,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:15,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:15,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:13:15,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:15,682 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:13:15,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-15 22:13:15,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:15,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:15,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:15,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:13:15,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:15,693 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 4#L560-2true [2019-11-15 22:13:15,693 INFO L793 eck$LassoCheckResult]: Loop: 4#L560-2true call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 6#L558-1true assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 10#L560true assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 4#L560-2true [2019-11-15 22:13:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:13:15,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:15,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566550942] [2019-11-15 22:13:15,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:15,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:15,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,061 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2019-11-15 22:13:16,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:16,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757101853] [2019-11-15 22:13:16,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-15 22:13:16,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:16,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108530286] [2019-11-15 22:13:16,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:16,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:16,480 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 22:13:16,611 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:13:19,528 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 179 DAG size of output: 155 [2019-11-15 22:13:20,716 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 153 [2019-11-15 22:13:20,737 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:20,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:20,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:20,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:20,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:13:20,739 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:20,739 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:20,739 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:20,739 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca.i_Iteration1_Lasso [2019-11-15 22:13:20,739 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:20,740 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:20,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:20,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:22,992 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 127 [2019-11-15 22:13:23,352 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-15 22:13:23,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:23,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:23,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:23,863 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 22:13:23,996 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-15 22:13:47,318 WARN L191 SmtUtils]: Spent 23.20 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-11-15 22:13:47,507 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:13:47,672 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:13:47,681 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:13:47,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,696 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,752 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,752 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,778 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,778 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,816 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,817 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,838 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,865 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,865 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,878 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,878 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:47,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,883 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:47,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:47,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:47,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:47,888 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:47,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:47,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:47,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:47,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:47,895 INFO L202 nArgumentSynthesizer]: 128 stem disjuncts [2019-11-15 22:13:47,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:47,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,065 INFO L400 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-11-15 22:13:48,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:48,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:48,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:48,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:48,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:48,909 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:48,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:48,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,920 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,920 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,921 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:48,921 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:48,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:48,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:48,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:48,927 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:48,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:48,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:48,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:48,928 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:48,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:48,930 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:13:48,935 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:13:48,935 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:13:48,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:13:48,939 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:13:48,939 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:13:48,940 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 1 Supporting invariants [] [2019-11-15 22:13:49,873 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-11-15 22:13:49,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:13:49,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:13:49,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:49,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:13:49,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:50,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:13:50,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:50,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:50,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:50,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:50,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:13:50,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:50,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:50,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:13:50,348 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-15 22:13:50,349 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.3 percent of original size [2019-11-15 22:13:50,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:13:50,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:97 [2019-11-15 22:13:51,252 WARN L191 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:13:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:51,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:13:51,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-11-15 22:13:52,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2019-11-15 22:13:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:13:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 22:13:52,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:13:52,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:52,419 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:13:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:52,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:13:52,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:52,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:13:52,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:52,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:52,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:52,612 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:52,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:13:52,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:52,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:52,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:13:52,738 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-15 22:13:52,738 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.3 percent of original size [2019-11-15 22:13:52,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:13:52,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:97 [2019-11-15 22:13:53,615 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:13:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:53,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:13:53,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-11-15 22:13:55,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2019-11-15 22:13:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:13:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 22:13:55,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:13:55,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:55,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:13:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:55,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:13:55,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:55,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:13:55,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:55,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:55,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:55,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:55,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:13:55,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:55,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:55,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:13:55,767 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-15 22:13:55,768 INFO L567 ElimStorePlain]: treesize reduction 62, result has 61.3 percent of original size [2019-11-15 22:13:55,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:13:55,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:94 [2019-11-15 22:13:56,714 WARN L191 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:13:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:56,715 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:13:56,715 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-11-15 22:13:57,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 24 states and 31 transitions. Complement of second has 7 states. [2019-11-15 22:13:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:13:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-15 22:13:57,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:13:57,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:57,832 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:13:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:57,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:13:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:57,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:13:57,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:57,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:57,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:13:57,980 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:57,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:13:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:57,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:13:58,079 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.3 percent of original size [2019-11-15 22:13:58,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:13:58,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:97 [2019-11-15 22:13:58,962 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:13:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:58,963 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:13:58,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-11-15 22:14:01,630 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-15 22:14:01,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 9 states. [2019-11-15 22:14:01,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:14:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-11-15 22:14:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:14:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:14:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 22:14:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:01,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-11-15 22:14:01,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:14:01,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 11 states and 14 transitions. [2019-11-15 22:14:01,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 22:14:01,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 22:14:01,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 22:14:01,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:14:01,665 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:14:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 22:14:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 22:14:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 22:14:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 22:14:01,686 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:14:01,686 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 22:14:01,686 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:14:01,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 22:14:01,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:14:01,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:01,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:01,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:14:01,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:14:01,688 INFO L791 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 700#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 701#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 706#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 708#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 702#L560-2 [2019-11-15 22:14:01,688 INFO L793 eck$LassoCheckResult]: Loop: 702#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 703#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 710#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 702#L560-2 [2019-11-15 22:14:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-15 22:14:01,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:01,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406546470] [2019-11-15 22:14:01,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2019-11-15 22:14:01,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:01,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461176504] [2019-11-15 22:14:01,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,791 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-11-15 22:14:01,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:01,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187036826] [2019-11-15 22:14:01,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:01,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:01,932 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:02,045 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 22:14:06,724 WARN L191 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 211 DAG size of output: 181 [2019-11-15 22:14:08,500 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 166 [2019-11-15 22:14:08,505 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:14:08,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:14:08,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:14:08,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:14:08,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:14:08,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:08,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:14:08,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:14:08,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca.i_Iteration2_Lasso [2019-11-15 22:14:08,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:14:08,506 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:14:08,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:08,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:08,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:08,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:10,685 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 137 [2019-11-15 22:14:11,080 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-15 22:14:11,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:11,644 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-15 22:14:11,766 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-15 22:14:34,532 WARN L191 SmtUtils]: Spent 22.63 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-11-15 22:14:34,695 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 22:14:34,829 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:14:34,829 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:14:34,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:34,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:34,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:34,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,834 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:34,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:34,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:34,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,837 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,848 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,848 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,854 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,855 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,865 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,865 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,872 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,872 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:34,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:34,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:34,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:34,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:34,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:34,876 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:34,877 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:34,894 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:14:34,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:14:34,904 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:14:34,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:14:34,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:14:34,906 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:14:34,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 1 Supporting invariants [] [2019-11-15 22:14:35,603 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2019-11-15 22:14:35,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:14:35,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:14:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:35,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:14:35,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:35,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:35,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2019-11-15 22:14:35,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:35,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:35,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:35,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-11-15 22:14:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:14:35,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:35,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:35,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:35,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:35,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:14:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:35,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:35,952 INFO L567 ElimStorePlain]: treesize reduction 62, result has 61.3 percent of original size [2019-11-15 22:14:35,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:14:35,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:94 [2019-11-15 22:14:36,821 WARN L191 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:14:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:36,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:14:36,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 22:14:38,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 24 transitions. Complement of second has 8 states. [2019-11-15 22:14:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:14:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 22:14:38,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:14:38,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:38,645 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:14:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:14:38,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:38,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:38,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2019-11-15 22:14:38,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:38,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:38,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:38,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-11-15 22:14:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:14:38,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:38,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:38,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:38,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:38,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:14:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:38,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:38,944 INFO L567 ElimStorePlain]: treesize reduction 62, result has 61.3 percent of original size [2019-11-15 22:14:38,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:14:38,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:94 [2019-11-15 22:14:39,796 WARN L191 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:14:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:39,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:14:39,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 22:14:41,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 24 transitions. Complement of second has 8 states. [2019-11-15 22:14:41,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:14:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 22:14:41,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:14:41,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:41,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:14:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:41,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:14:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:41,697 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:41,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2019-11-15 22:14:41,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:41,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:41,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:41,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-11-15 22:14:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:41,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:14:41,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:41,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:41,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:41,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:41,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:14:41,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:41,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:41,896 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.3 percent of original size [2019-11-15 22:14:41,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:14:41,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:97 [2019-11-15 22:14:42,728 WARN L191 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:14:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:42,728 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:14:42,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 22:14:43,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 16 states and 20 transitions. Complement of second has 7 states. [2019-11-15 22:14:43,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:14:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 22:14:43,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:14:43,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:43,750 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:14:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:43,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:14:43,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:43,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:43,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2019-11-15 22:14:43,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:43,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:43,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:43,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2019-11-15 22:14:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:43,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:14:43,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:43,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:43,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:43,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:43,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 76 [2019-11-15 22:14:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:43,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:44,046 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.3 percent of original size [2019-11-15 22:14:44,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:14:44,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:97 [2019-11-15 22:14:44,874 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:14:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:44,875 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 22:14:44,875 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 22:14:47,363 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-15 22:14:47,374 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 14 states and 18 transitions. Complement of second has 7 states. [2019-11-15 22:14:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:14:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 22:14:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:14:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 22:14:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 22:14:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:47,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2019-11-15 22:14:47,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:14:47,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2019-11-15 22:14:47,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 22:14:47,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 22:14:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-11-15 22:14:47,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:14:47,380 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 22:14:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-11-15 22:14:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 8. [2019-11-15 22:14:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 22:14:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-15 22:14:47,382 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:14:47,382 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-15 22:14:47,382 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:14:47,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-15 22:14:47,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:14:47,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:47,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:47,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:14:47,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:14:47,383 INFO L791 eck$LassoCheckResult]: Stem: 1421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1416#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1417#L560-2 [2019-11-15 22:14:47,383 INFO L793 eck$LassoCheckResult]: Loop: 1417#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1419#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1422#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1417#L560-2 [2019-11-15 22:14:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 22:14:47,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:47,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451811850] [2019-11-15 22:14:47,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-15 22:14:47,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:47,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483384974] [2019-11-15 22:14:47,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,435 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2019-11-15 22:14:47,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:47,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901602030] [2019-11-15 22:14:47,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:47,494 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:47,603 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 22:14:48,957 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 179 DAG size of output: 149 [2019-11-15 22:14:49,625 WARN L191 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-15 22:14:49,630 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:14:49,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:14:49,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:14:49,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:14:49,630 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:14:49,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:49,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:14:49,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:14:49,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca.i_Iteration3_Lasso [2019-11-15 22:14:49,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:14:49,631 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:14:49,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:49,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,215 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 125 [2019-11-15 22:14:51,732 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2019-11-15 22:14:51,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:51,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:52,014 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 22:14:52,297 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 22:14:52,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-15 22:15:13,876 WARN L191 SmtUtils]: Spent 21.38 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-11-15 22:15:14,039 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 22:15:14,138 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:15:14,138 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:15:14,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,141 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,141 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,143 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,144 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,147 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,147 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,158 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,163 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,163 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,173 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,173 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,177 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,181 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,200 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,206 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,212 INFO L202 nArgumentSynthesizer]: 128 stem disjuncts [2019-11-15 22:15:14,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,269 INFO L400 nArgumentSynthesizer]: We have 260 Motzkin's Theorem applications. [2019-11-15 22:15:14,269 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,825 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,837 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,837 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:15:14,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:15:14,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:15:14,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:15:14,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:15:14,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:15:14,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:15:14,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:15:14,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:15:14,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:15:14,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:15:14,896 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:15:14,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:15:14,899 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:15:14,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:15:14,900 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:15:14,900 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:15:14,900 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-11-15 22:15:15,934 INFO L297 tatePredicateManager]: 113 out of 116 supporting invariants were superfluous and have been removed [2019-11-15 22:15:15,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:15:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:16,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:15:16,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:16,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:15:16,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:16,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-11-15 22:15:16,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:16,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2019-11-15 22:15:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:16,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:15:16,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-15 22:15:16,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 7 states. [2019-11-15 22:15:16,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:15:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:15:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-15 22:15:16,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-15 22:15:16,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:15:16,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:15:16,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:15:16,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 22:15:16,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:15:16,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-15 22:15:16,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:15:16,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2019-11-15 22:15:16,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 22:15:16,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 22:15:16,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-11-15 22:15:16,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:15:16,139 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 22:15:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-11-15 22:15:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-15 22:15:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 22:15:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 22:15:16,141 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:15:16,141 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 22:15:16,141 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:15:16,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 22:15:16,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:15:16,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:15:16,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:15:16,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-15 22:15:16,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:15:16,145 INFO L791 eck$LassoCheckResult]: Stem: 1955#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1950#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1951#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1952#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1958#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 1960#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1956#L558-1 [2019-11-15 22:15:16,145 INFO L793 eck$LassoCheckResult]: Loop: 1956#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1957#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1959#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1956#L558-1 [2019-11-15 22:15:16,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2019-11-15 22:15:16,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:16,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625893326] [2019-11-15 22:15:16,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:16,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:15:16,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2019-11-15 22:15:16,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:16,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415687819] [2019-11-15 22:15:16,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:16,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:15:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2019-11-15 22:15:16,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:16,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487945218] [2019-11-15 22:15:16,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:16,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487945218] [2019-11-15 22:15:16,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693996615] [2019-11-15 22:15:16,427 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b2b17941-1112-4b4d-b696-f44dc89442f2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:16,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:15:16,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:16,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:15:16,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:16,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:16,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2019-11-15 22:15:16,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:16,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2019-11-15 22:15:16,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-11-15 22:15:16,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:16,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2019-11-15 22:15:16,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:15:16,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:15:16,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:16,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:15:16,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2019-11-15 22:15:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:16,702 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:16,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-15 22:15:16,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524126059] [2019-11-15 22:15:16,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:15:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:15:16,892 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-11-15 22:15:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:17,018 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-15 22:15:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:15:17,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-15 22:15:17,019 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:15:17,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-11-15 22:15:17,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:15:17,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:15:17,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:15:17,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:15:17,020 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:15:17,020 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:15:17,020 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:15:17,020 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:15:17,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:15:17,020 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:15:17,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:15:17,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:15:17 BoogieIcfgContainer [2019-11-15 22:15:17,025 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:15:17,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:15:17,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:15:17,025 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:15:17,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:15" (3/4) ... [2019-11-15 22:15:17,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:15:17,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:15:17,030 INFO L168 Benchmark]: Toolchain (without parser) took 122730.90 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -85.5 MB). Peak memory consumption was 976.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:17,031 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:17,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:17,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.75 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:17,032 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:17,033 INFO L168 Benchmark]: RCFGBuilder took 475.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:17,033 INFO L168 Benchmark]: BuchiAutomizer took 121456.87 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 939.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.7 MB). Peak memory consumption was 982.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:17,034 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 2.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:17,036 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 677.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.75 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 475.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 121456.87 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 939.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.7 MB). Peak memory consumption was 982.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 ms. Allocated memory is still 2.1 GB. Free memory is still 1.0 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 - 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 4 terminating modules (1 trivial, 1 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 4 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 121.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 97.4s. Construction of modules took 8.6s. Büchi inclusion checks took 15.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 2, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 52 SDslu, 7 SDs, 0 SdLazy, 183 SolverSat, 48 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 8.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital2151 mio100 ax101 hnf100 lsp97 ukn27 mio100 lsp37 div100 bol100 ite100 ukn100 eq197 hnf87 smp95 dnf5770 smp88 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 983ms VariablesStem: 15 VariablesLoop: 12 DisjunctsStem: 128 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 260 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...