./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-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_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/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 abee338f12eaa8176313da7ed567414f687b7fa7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:04:41,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:04:41,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:04:41,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:04:41,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:04:41,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:04:41,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:04:41,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:04:41,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:04:41,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:04:41,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:04:41,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:04:41,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:04:41,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:04:41,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:04:41,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:04:41,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:04:41,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:04:41,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:04:41,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:04:41,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:04:41,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:04:41,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:04:41,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:04:41,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:04:41,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:04:41,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:04:41,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:04:41,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:04:41,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:04:41,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:04:41,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:04:41,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:04:41,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:04:41,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:04:41,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:04:41,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:04:41,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:04:41,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:04:41,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:04:41,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:04:41,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:04:41,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:04:41,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:04:41,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:04:41,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:04:41,132 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:04:41,133 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:04:41,133 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:04:41,133 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:04:41,133 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:04:41,133 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:04:41,134 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:04:41,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:04:41,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:04:41,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:04:41,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:04:41,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:04:41,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:04:41,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:04:41,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:04:41,135 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:04:41,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:04:41,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:04:41,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:04:41,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:04:41,136 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:04:41,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:04:41,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:04:41,137 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:04:41,138 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:04:41,138 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_c46cdc36-7161-4b7c-9990-0d2b06c043b5/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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2019-11-16 00:04:41,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:04:41,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:04:41,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:04:41,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:04:41,199 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:04:41,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2019-11-16 00:04:41,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/data/b99a6d7c9/63beda7ca2374a55998f42e25496288a/FLAGb19d6a47a [2019-11-16 00:04:41,755 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:04:41,764 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2019-11-16 00:04:41,785 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/data/b99a6d7c9/63beda7ca2374a55998f42e25496288a/FLAGb19d6a47a [2019-11-16 00:04:42,090 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/bin/uautomizer/data/b99a6d7c9/63beda7ca2374a55998f42e25496288a [2019-11-16 00:04:42,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:04:42,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:04:42,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:04:42,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:04:42,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:04:42,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc0e3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42, skipping insertion in model container [2019-11-16 00:04:42,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:04:42,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:04:42,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:04:42,560 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:04:42,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:04:42,665 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:04:42,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42 WrapperNode [2019-11-16 00:04:42,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:04:42,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:04:42,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:04:42,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:04:42,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:04:42,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:04:42,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:04:42,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:04:42,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... [2019-11-16 00:04:42,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:04:42,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:04:42,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:04:42,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:04:42,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/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-16 00:04:42,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:04:42,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:04:42,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:04:42,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:04:42,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:04:42,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:04:43,298 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:04:43,299 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:04:43,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:43 BoogieIcfgContainer [2019-11-16 00:04:43,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:04:43,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:04:43,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:04:43,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:04:43,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:04:43,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:04:42" (1/3) ... [2019-11-16 00:04:43,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ad0bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:04:43, skipping insertion in model container [2019-11-16 00:04:43,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:04:43,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:42" (2/3) ... [2019-11-16 00:04:43,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ad0bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:04:43, skipping insertion in model container [2019-11-16 00:04:43,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:04:43,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:43" (3/3) ... [2019-11-16 00:04:43,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2019-11-16 00:04:43,362 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:04:43,363 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:04:43,363 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:04:43,363 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:04:43,363 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:04:43,364 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:04:43,364 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:04:43,364 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:04:43,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:04:43,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:04:43,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:43,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:43,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:43,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:04:43,412 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:04:43,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-16 00:04:43,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:04:43,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:43,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:43,415 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:43,416 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:04:43,423 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 8#L559-4true [2019-11-16 00:04:43,423 INFO L793 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 6#L559-3true assume !true; 8#L559-4true [2019-11-16 00:04:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:04:43,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:43,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403204829] [2019-11-16 00:04:43,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:43,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2019-11-16 00:04:43,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:43,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459632903] [2019-11-16 00:04:43,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:43,625 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-16 00:04:43,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459632903] [2019-11-16 00:04:43,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:43,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-16 00:04:43,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239693334] [2019-11-16 00:04:43,632 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:04:43,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:04:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:04:43,651 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-16 00:04:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:43,659 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-11-16 00:04:43,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:04:43,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-11-16 00:04:43,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:04:43,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2019-11-16 00:04:43,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:04:43,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:04:43,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2019-11-16 00:04:43,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:04:43,669 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:04:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2019-11-16 00:04:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:04:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:04:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-11-16 00:04:43,706 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:04:43,706 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-11-16 00:04:43,706 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:04:43,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2019-11-16 00:04:43,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:04:43,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:43,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:43,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:43,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:04:43,711 INFO L791 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 43#L559-4 [2019-11-16 00:04:43,711 INFO L793 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2019-11-16 00:04:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-16 00:04:43,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:43,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833773502] [2019-11-16 00:04:43,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:43,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2019-11-16 00:04:43,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:43,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665530193] [2019-11-16 00:04:43,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:43,851 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-16 00:04:43,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665530193] [2019-11-16 00:04:43,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:43,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:43,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603133160] [2019-11-16 00:04:43,852 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:04:43,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:04:43,853 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-16 00:04:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:43,946 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-11-16 00:04:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:04:43,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-11-16 00:04:43,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-16 00:04:43,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-11-16 00:04:43,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:04:43,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:04:43,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-16 00:04:43,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:04:43,950 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-16 00:04:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-16 00:04:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-11-16 00:04:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:04:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-16 00:04:43,952 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:04:43,952 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:04:43,952 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:04:43,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-16 00:04:43,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:04:43,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:43,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:43,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:43,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:04:43,954 INFO L791 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 80#L559-4 [2019-11-16 00:04:43,954 INFO L793 eck$LassoCheckResult]: Loop: 80#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 86#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 87#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 89#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 84#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 85#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L559-4 [2019-11-16 00:04:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-16 00:04:43,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:43,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947387157] [2019-11-16 00:04:43,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:43,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:44,004 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2019-11-16 00:04:44,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:44,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132987448] [2019-11-16 00:04:44,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:44,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132987448] [2019-11-16 00:04:44,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:44,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:44,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630667020] [2019-11-16 00:04:44,049 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:04:44,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:04:44,050 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-16 00:04:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:44,138 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-16 00:04:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:04:44,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-16 00:04:44,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-16 00:04:44,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-16 00:04:44,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-16 00:04:44,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:04:44,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-16 00:04:44,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:04:44,142 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-16 00:04:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-16 00:04:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-16 00:04:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:04:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-16 00:04:44,144 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:04:44,144 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:04:44,144 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:04:44,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-16 00:04:44,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:04:44,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:44,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:44,146 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:44,146 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:44,146 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 117#L559-4 [2019-11-16 00:04:44,146 INFO L793 eck$LassoCheckResult]: Loop: 117#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 121#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 122#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 126#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 123#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 124#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 128#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 117#L559-4 [2019-11-16 00:04:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:44,147 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-16 00:04:44,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:44,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729283722] [2019-11-16 00:04:44,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:44,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2019-11-16 00:04:44,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:44,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651611182] [2019-11-16 00:04:44,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:44,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:44,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651611182] [2019-11-16 00:04:44,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002526413] [2019-11-16 00:04:44,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c46cdc36-7161-4b7c-9990-0d2b06c043b5/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-16 00:04:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:44,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:04:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:44,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:44,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:44,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2019-11-16 00:04:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:44,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:44,618 INFO L567 ElimStorePlain]: treesize reduction 35, result has 44.4 percent of original size [2019-11-16 00:04:44,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:44,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-11-16 00:04:44,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:44,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:44,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:04:44,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:44,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:04:44,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:44,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:44,726 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-16 00:04:44,726 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:3 [2019-11-16 00:04:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:44,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:44,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-16 00:04:44,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935545595] [2019-11-16 00:04:44,729 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:04:44,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:04:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:44,730 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-16 00:04:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:57,115 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-16 00:04:57,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:04:57,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-16 00:04:57,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:04:57,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-16 00:04:57,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:04:57,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-16 00:04:57,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-16 00:04:57,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:04:57,118 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:04:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-16 00:04:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-16 00:04:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:04:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-16 00:04:57,120 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:04:57,120 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-16 00:04:57,120 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:04:57,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-16 00:04:57,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-16 00:04:57,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:57,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:57,121 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:04:57,121 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:57,122 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L559-4 [2019-11-16 00:04:57,123 INFO L793 eck$LassoCheckResult]: Loop: 191#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 195#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 196#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 200#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 201#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 192#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 193#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 199#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 191#L559-4 [2019-11-16 00:04:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-11-16 00:04:57,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:57,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054538558] [2019-11-16 00:04:57,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,144 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2019-11-16 00:04:57,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:57,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208592061] [2019-11-16 00:04:57,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,168 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2019-11-16 00:04:57,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:57,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502479633] [2019-11-16 00:04:57,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:57,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:57,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:57,483 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-16 00:04:57,775 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-16 00:04:57,880 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:04:57,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:04:57,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:04:57,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:04:57,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:04:57,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:04:57,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:04:57,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:04:57,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration5_Lasso [2019-11-16 00:04:57,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:04:57,882 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:04:57,902 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-16 00:04:57,921 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-16 00:04:57,924 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-16 00:04:57,927 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-16 00:04:57,932 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-16 00:04:57,936 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-16 00:04:57,940 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-16 00:04:57,944 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-16 00:04:57,947 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-16 00:04:57,950 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-16 00:04:57,953 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-16 00:04:57,956 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-16 00:04:57,960 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-16 00:04:57,964 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-16 00:04:57,966 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-16 00:04:57,968 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-16 00:04:57,970 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-16 00:04:57,973 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-16 00:04:57,975 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-16 00:04:57,978 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-16 00:04:57,982 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-16 00:04:57,985 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-16 00:04:58,245 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-16 00:04:58,389 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-16 00:04:58,389 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-16 00:04:58,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:04:58,898 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:04:59,051 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:04:59,056 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:04:59,058 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-16 00:04:59,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,067 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-16 00:04:59,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,070 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-16 00:04:59,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,075 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-16 00:04:59,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,078 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-16 00:04:59,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,086 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-16 00:04:59,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,090 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-16 00:04:59,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,094 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-16 00:04:59,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,102 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-16 00:04:59,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,105 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,108 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-16 00:04:59,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,112 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-16 00:04:59,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,116 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-16 00:04:59,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,117 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,120 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-16 00:04:59,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,123 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,127 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-16 00:04:59,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,141 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-16 00:04:59,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,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-16 00:04:59,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,147 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-16 00:04:59,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,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-16 00:04:59,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,152 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-16 00:04:59,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,155 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-16 00:04:59,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,158 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,158 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,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-16 00:04:59,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:04:59,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:04:59,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:04:59,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,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-16 00:04:59,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,167 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,167 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,189 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-16 00:04:59,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,193 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,195 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:04:59,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,214 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:04:59,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,219 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:04:59,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:04:59,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:04:59,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:04:59,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:04:59,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:04:59,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:04:59,266 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:04:59,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:04:59,303 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:04:59,331 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:04:59,331 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:04:59,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:04:59,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:04:59,336 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:04:59,337 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-11-16 00:04:59,375 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-16 00:04:59,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:04:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:59,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:04:59,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:59,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:04:59,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:59,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:59,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-11-16 00:04:59,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:59,451 INFO L567 ElimStorePlain]: treesize reduction 1, result has 94.7 percent of original size [2019-11-16 00:04:59,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:04:59,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:59,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:59,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:04:59,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2019-11-16 00:04:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:59,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:04:59,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-16 00:04:59,709 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2019-11-16 00:04:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:04:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:04:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-16 00:04:59,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:04:59,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:04:59,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-16 00:04:59,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:04:59,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-16 00:04:59,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:04:59,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-11-16 00:04:59,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:04:59,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2019-11-16 00:04:59,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-16 00:04:59,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:04:59,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-11-16 00:04:59,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:04:59,720 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-11-16 00:04:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-11-16 00:04:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-11-16 00:04:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:04:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-16 00:04:59,724 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-16 00:04:59,724 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-16 00:04:59,724 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:04:59,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-16 00:04:59,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:04:59,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:04:59,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:04:59,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:04:59,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2019-11-16 00:04:59,726 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 355#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-11-16 00:04:59,726 INFO L793 eck$LassoCheckResult]: Loop: 367#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 368#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 371#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 363#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 364#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 373#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 380#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 379#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 378#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 357#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-11-16 00:04:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-16 00:04:59,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:59,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663794387] [2019-11-16 00:04:59,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,747 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2019-11-16 00:04:59,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:59,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573913058] [2019-11-16 00:04:59,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,766 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2019-11-16 00:04:59,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:59,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088497374] [2019-11-16 00:04:59,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:59,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:59,818 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:00,029 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-16 00:05:00,332 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-16 00:05:00,626 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:05:00,628 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:05:00,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:05:00,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:05:00,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:05:00,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:05:00,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:05:00,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:05:00,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:05:00,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2019-11-16 00:05:00,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:05:00,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:05:00,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-16 00:05:00,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-16 00:05:00,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-16 00:05:00,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-16 00:05:00,648 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-16 00:05:00,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-16 00:05:00,654 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-16 00:05:00,656 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-16 00:05:00,658 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-16 00:05:00,661 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-16 00:05:00,663 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-16 00:05:00,665 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-16 00:05:00,669 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-16 00:05:00,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:00,673 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-16 00:05:00,675 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-16 00:05:00,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:00,681 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-16 00:05:00,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:00,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:00,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:00,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:01,155 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-16 00:05:01,538 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-16 00:05:01,920 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-16 00:05:02,106 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:05:02,117 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:05:02,117 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:05:02,118 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-16 00:05:02,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,123 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-16 00:05:02,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,125 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-16 00:05:02,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,127 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-16 00:05:02,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,129 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,131 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-16 00:05:02,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,132 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,135 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-16 00:05:02,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,136 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,138 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-16 00:05:02,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,140 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-16 00:05:02,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,143 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-16 00:05:02,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,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-16 00:05:02,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,147 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-16 00:05:02,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,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-16 00:05:02,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,151 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,153 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-16 00:05:02,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,154 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,154 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,155 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-16 00:05:02,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,158 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-16 00:05:02,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,160 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-16 00:05:02,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,162 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,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-16 00:05:02,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,166 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-16 00:05:02,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,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-16 00:05:02,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,170 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-16 00:05:02,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:02,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:02,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:02,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,173 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-16 00:05:02,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,174 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,174 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,177 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-16 00:05:02,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,180 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:02,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:02,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,195 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:02,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:02,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:02,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:02,202 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:05:02,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:02,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:02,205 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:05:02,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:02,240 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:05:02,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:05:02,268 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:05:02,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:05:02,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:05:02,270 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:05:02,270 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2 Supporting invariants [] [2019-11-16 00:05:02,335 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-16 00:05:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:02,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:05:02,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:02,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:05:02,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:05:02,441 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:05:02,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-16 00:05:02,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 73 states and 98 transitions. Complement of second has 10 states. [2019-11-16 00:05:02,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:05:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:05:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-11-16 00:05:02,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-16 00:05:02,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:02,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 10 letters. [2019-11-16 00:05:02,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:02,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 20 letters. [2019-11-16 00:05:02,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:02,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 98 transitions. [2019-11-16 00:05:02,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:05:02,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 89 transitions. [2019-11-16 00:05:02,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:05:02,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:05:02,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 89 transitions. [2019-11-16 00:05:02,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:05:02,558 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-11-16 00:05:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 89 transitions. [2019-11-16 00:05:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-11-16 00:05:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:05:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2019-11-16 00:05:02,564 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-11-16 00:05:02,564 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-11-16 00:05:02,564 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:05:02,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2019-11-16 00:05:02,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:05:02,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:02,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:02,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:05:02,566 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:05:02,567 INFO L791 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 571#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 572#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 615#L553-1 assume !test_fun_#t~short6; 585#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 590#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 580#L555-3 [2019-11-16 00:05:02,567 INFO L793 eck$LassoCheckResult]: Loop: 580#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 581#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 580#L555-3 [2019-11-16 00:05:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2019-11-16 00:05:02,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:02,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076714023] [2019-11-16 00:05:02,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:02,586 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-16 00:05:02,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076714023] [2019-11-16 00:05:02,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:02,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:05:02,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816825069] [2019-11-16 00:05:02,587 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:05:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-11-16 00:05:02,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:02,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234635872] [2019-11-16 00:05:02,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:02,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:05:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:05:02,641 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-11-16 00:05:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:02,653 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2019-11-16 00:05:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:05:02,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2019-11-16 00:05:02,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:05:02,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 53 states and 67 transitions. [2019-11-16 00:05:02,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:05:02,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:05:02,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-11-16 00:05:02,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:05:02,658 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-11-16 00:05:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-11-16 00:05:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-16 00:05:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:05:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-11-16 00:05:02,662 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-11-16 00:05:02,662 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-11-16 00:05:02,662 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:05:02,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2019-11-16 00:05:02,663 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:05:02,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:02,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:02,664 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:05:02,664 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:05:02,664 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 692#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 737#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 705#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 710#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 700#L555-3 [2019-11-16 00:05:02,664 INFO L793 eck$LassoCheckResult]: Loop: 700#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 701#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 700#L555-3 [2019-11-16 00:05:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-11-16 00:05:02,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:02,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721818686] [2019-11-16 00:05:02,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:02,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-11-16 00:05:02,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:02,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443159784] [2019-11-16 00:05:02,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,707 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2019-11-16 00:05:02,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:02,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945069597] [2019-11-16 00:05:02,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:02,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:02,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:03,160 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-11-16 00:05:03,270 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:05:03,272 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:05:03,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:05:03,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:05:03,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:05:03,273 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:05:03,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:05:03,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:05:03,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:05:03,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2019-11-16 00:05:03,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:05:03,273 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:05:03,276 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-16 00:05:03,282 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-16 00:05:03,284 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-16 00:05:03,285 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-16 00:05:03,288 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-16 00:05:03,289 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-16 00:05:03,292 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-16 00:05:03,298 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-16 00:05:03,300 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-16 00:05:03,309 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-16 00:05:03,313 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-16 00:05:03,315 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-16 00:05:03,318 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-16 00:05:03,320 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-16 00:05:03,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:03,325 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-16 00:05:03,327 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-16 00:05:03,330 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-16 00:05:03,340 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-16 00:05:03,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:03,345 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-16 00:05:03,347 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-16 00:05:03,354 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-16 00:05:03,521 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-16 00:05:03,900 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:05:03,972 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:05:03,972 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:05:03,972 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-16 00:05:03,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,973 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,975 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-16 00:05:03,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,975 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,976 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-16 00:05:03,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,978 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-16 00:05:03,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:03,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:03,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,981 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-16 00:05:03,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,982 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,983 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-16 00:05:03,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,984 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:03,984 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:03,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,986 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-16 00:05:03,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,988 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-16 00:05:03,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,990 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-16 00:05:03,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,992 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-16 00:05:03,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,993 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:03,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:03,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,994 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-16 00:05:03,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,996 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-16 00:05:03,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:03,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:03,998 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-16 00:05:03,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:03,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:03,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:03,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:03,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:03,999 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:03,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,000 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-16 00:05:04,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,002 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-16 00:05:04,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,004 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-16 00:05:04,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,006 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-16 00:05:04,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,007 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:04,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,009 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-16 00:05:04,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,010 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-16 00:05:04,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,012 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-16 00:05:04,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,014 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-16 00:05:04,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:05:04,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:05:04,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:05:04,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,016 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-16 00:05:04,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:04,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,019 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-16 00:05:04,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:04,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,054 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-16 00:05:04,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:04,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,063 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-16 00:05:04,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,063 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:05:04,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,067 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:05:04,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:04,078 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-16 00:05:04,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:04,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:04,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:04,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:04,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:04,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:04,092 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:05:04,119 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:05:04,119 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:05:04,120 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:05:04,121 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:05:04,121 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:05:04,121 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-11-16 00:05:04,178 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-16 00:05:04,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:05:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:04,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:05:04,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:04,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:05:04,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:04,241 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-16 00:05:04,241 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-16 00:05:04,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-16 00:05:04,289 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 149 states and 188 transitions. Complement of second has 6 states. [2019-11-16 00:05:04,290 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-16 00:05:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:05:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-16 00:05:04,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:05:04,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:04,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:05:04,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:04,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:05:04,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:04,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-11-16 00:05:04,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:05:04,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2019-11-16 00:05:04,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:05:04,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:05:04,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-16 00:05:04,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:05:04,296 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-16 00:05:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-16 00:05:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-16 00:05:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:05:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-16 00:05:04,299 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-16 00:05:04,299 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-16 00:05:04,299 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:05:04,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-11-16 00:05:04,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:05:04,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:04,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:04,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:04,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:05:04,301 INFO L791 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 980#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 981#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 993#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1002#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1001#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1000#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 999#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 997#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-11-16 00:05:04,301 INFO L793 eck$LassoCheckResult]: Loop: 982#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 983#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-11-16 00:05:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2019-11-16 00:05:04,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:04,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803741149] [2019-11-16 00:05:04,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,319 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2019-11-16 00:05:04,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:04,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879283974] [2019-11-16 00:05:04,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2019-11-16 00:05:04,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:04,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155326790] [2019-11-16 00:05:04,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:04,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:04,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:04,973 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-11-16 00:05:05,144 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:05:05,148 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:05:05,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:05:05,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:05:05,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:05:05,149 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:05:05,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:05:05,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:05:05,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:05:05,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2019-11-16 00:05:05,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:05:05,150 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:05:05,152 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-16 00:05:05,427 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-16 00:05:05,475 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-16 00:05:05,477 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-16 00:05:05,479 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-16 00:05:05,481 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-16 00:05:05,482 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-16 00:05:05,489 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-16 00:05:05,491 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-16 00:05:05,493 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-16 00:05:05,495 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-16 00:05:05,501 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-16 00:05:05,503 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-16 00:05:05,505 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-16 00:05:05,507 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-16 00:05:05,509 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-16 00:05:05,511 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-16 00:05:05,513 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-16 00:05:05,515 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-16 00:05:05,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:05,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:05,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:05,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:05:05,997 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:05:06,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:05:06,134 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:05:06,135 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-16 00:05:06,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,137 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:05:06,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,138 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:05:06,138 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:06,147 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-16 00:05:06,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:06,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:06,154 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:06,169 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-16 00:05:06,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:06,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,172 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:06,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:06,174 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-16 00:05:06,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:06,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,178 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:06,178 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:06,182 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-16 00:05:06,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:06,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,183 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:06,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:05:06,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:05:06,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:05:06,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:05:06,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:05:06,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:05:06,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:05:06,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:05:06,218 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:05:06,231 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:05:06,231 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:05:06,232 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:05:06,233 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-16 00:05:06,233 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:05:06,234 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem11 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0] [2019-11-16 00:05:06,266 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-16 00:05:06,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:05:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:05:06,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:05:06,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:06,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-16 00:05:06,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:06,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:06,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:05:06,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-16 00:05:06,369 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-16 00:05:06,369 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-16 00:05:06,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:05:06,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 61 states and 75 transitions. Complement of second has 6 states. [2019-11-16 00:05:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:05:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:05:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:05:06,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:05:06,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:06,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:05:06,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:06,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:05:06,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:05:06,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2019-11-16 00:05:06,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:05:06,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 69 transitions. [2019-11-16 00:05:06,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-16 00:05:06,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-16 00:05:06,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 69 transitions. [2019-11-16 00:05:06,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:05:06,435 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-11-16 00:05:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 69 transitions. [2019-11-16 00:05:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-16 00:05:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:05:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-11-16 00:05:06,446 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-11-16 00:05:06,446 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-11-16 00:05:06,446 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:05:06,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2019-11-16 00:05:06,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:05:06,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:05:06,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:05:06,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-16 00:05:06,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:05:06,449 INFO L791 eck$LassoCheckResult]: Stem: 1185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1179#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1180#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1194#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1192#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1193#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1191#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1183#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1184#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1207#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1206#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1205#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1204#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1203#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8; 1202#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1201#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1199#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-11-16 00:05:06,450 INFO L793 eck$LassoCheckResult]: Loop: 1181#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1182#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-11-16 00:05:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2019-11-16 00:05:06,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:06,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951683151] [2019-11-16 00:05:06,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:06,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:05:06,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951683151] [2019-11-16 00:05:06,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:06,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:06,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034942147] [2019-11-16 00:05:06,500 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:05:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2019-11-16 00:05:06,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:06,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263573667] [2019-11-16 00:05:06,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:06,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:06,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:05:06,511 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:05:06,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:06,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:06,547 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-16 00:05:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:06,615 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-16 00:05:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:05:06,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-11-16 00:05:06,616 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:05:06,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-11-16 00:05:06,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:05:06,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:05:06,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:05:06,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:05:06,617 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:06,617 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:06,617 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:05:06,617 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:05:06,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:05:06,618 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:05:06,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:05:06,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:05:06 BoogieIcfgContainer [2019-11-16 00:05:06,624 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:05:06,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:05:06,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:05:06,628 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:05:06,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:43" (3/4) ... [2019-11-16 00:05:06,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:05:06,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:05:06,635 INFO L168 Benchmark]: Toolchain (without parser) took 24539.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 940.7 MB in the beginning and 866.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,636 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:06,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,643 INFO L168 Benchmark]: Boogie Preprocessor took 34.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,643 INFO L168 Benchmark]: RCFGBuilder took 536.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,645 INFO L168 Benchmark]: BuchiAutomizer took 23322.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 228.9 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:06,648 INFO L168 Benchmark]: Witness Printer took 6.43 ms. Allocated memory is still 1.2 GB. Free memory is still 866.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:06,654 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 536.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23322.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 228.9 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.43 ms. Allocated memory is still 1.2 GB. Free memory is still 866.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.2s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 9.5s. Construction of modules took 12.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 117 SDtfs, 89 SDslu, 103 SDs, 0 SdLazy, 235 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.4s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax107 hnf99 lsp81 ukn75 mio100 lsp32 div100 bol103 ite100 ukn100 eq176 hnf89 smp96 dnf191 smp85 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...